./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6798e3458bb0edb710871ba474a89df614e6e21e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6798e3458bb0edb710871ba474a89df614e6e21e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:31:06,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:31:06,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:31:06,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:31:06,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:31:06,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:31:06,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:31:06,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:31:06,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:31:06,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:31:06,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:31:06,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:31:06,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:31:06,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:31:06,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:31:06,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:31:06,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:31:06,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:31:06,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:31:06,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:31:06,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:31:06,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:31:06,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:31:06,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:31:06,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:31:06,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:31:06,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:31:06,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:31:06,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:31:06,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:31:06,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:31:06,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:31:06,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:31:06,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:31:06,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:31:06,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:31:06,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:31:06,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:31:06,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:31:06,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:31:06,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:31:06,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:31:06,556 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:31:06,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:31:06,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:31:06,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:31:06,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:31:06,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:31:06,560 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:31:06,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:31:06,561 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:31:06,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:31:06,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:31:06,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:31:06,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:31:06,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:31:06,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:31:06,563 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:31:06,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:31:06,563 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:31:06,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:31:06,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:31:06,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:31:06,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:31:06,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:06,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:31:06,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:31:06,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:31:06,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:31:06,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:31:06,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:31:06,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:31:06,566 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 -> 6798e3458bb0edb710871ba474a89df614e6e21e [2021-08-25 20:31:06,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:31:06,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:31:06,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:31:06,896 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:31:06,897 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:31:06,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c [2021-08-25 20:31:06,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf08a525/86c9064af4484915b50ea9e4718b6d3a/FLAG110c230f5 [2021-08-25 20:31:07,494 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:31:07,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c [2021-08-25 20:31:07,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf08a525/86c9064af4484915b50ea9e4718b6d3a/FLAG110c230f5 [2021-08-25 20:31:07,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf08a525/86c9064af4484915b50ea9e4718b6d3a [2021-08-25 20:31:07,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:31:07,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:31:07,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:07,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:31:07,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:31:07,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:07" (1/1) ... [2021-08-25 20:31:07,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501a0520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:07, skipping insertion in model container [2021-08-25 20:31:07,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:07" (1/1) ... [2021-08-25 20:31:07,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:31:07,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:31:08,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c[72131,72144] [2021-08-25 20:31:08,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:08,239 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:31:08,362 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c[72131,72144] [2021-08-25 20:31:08,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:08,385 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:31:08,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08 WrapperNode [2021-08-25 20:31:08,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:08,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:08,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:31:08,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:31:08,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:08,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:31:08,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:31:08,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:31:08,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:31:08,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:31:08,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:31:08,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:31:08,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (1/1) ... [2021-08-25 20:31:08,596 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:08,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:31:08,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:31:08,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:31:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:31:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:31:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:31:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:31:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:31:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:31:08,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:31:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:31:08,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:31:08,804 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:31:09,524 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:31:09,525 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:31:09,534 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:31:09,534 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:31:09,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:09 BoogieIcfgContainer [2021-08-25 20:31:09,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:31:09,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:31:09,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:31:09,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:31:09,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:31:07" (1/3) ... [2021-08-25 20:31:09,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bb6965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:09, skipping insertion in model container [2021-08-25 20:31:09,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:08" (2/3) ... [2021-08-25 20:31:09,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bb6965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:09, skipping insertion in model container [2021-08-25 20:31:09,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:09" (3/3) ... [2021-08-25 20:31:09,541 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2021-08-25 20:31:09,544 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:31:09,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:31:09,587 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:31:09,598 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:31:09,600 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:31:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 144 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:31:09,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:09,625 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:09,626 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:09,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1126320416, now seen corresponding path program 1 times [2021-08-25 20:31:09,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:09,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446034866] [2021-08-25 20:31:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:09,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:09,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:09,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446034866] [2021-08-25 20:31:09,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446034866] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:09,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:09,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:09,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296064323] [2021-08-25 20:31:09,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:09,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:09,859 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 144 states have internal predecessors, (245), 0 states have call successors, (0), 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 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:10,207 INFO L93 Difference]: Finished difference Result 317 states and 535 transitions. [2021-08-25 20:31:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:10,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-08-25 20:31:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:10,216 INFO L225 Difference]: With dead ends: 317 [2021-08-25 20:31:10,216 INFO L226 Difference]: Without dead ends: 160 [2021-08-25 20:31:10,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-25 20:31:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-08-25 20:31:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 142 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2021-08-25 20:31:10,253 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 41 [2021-08-25 20:31:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:10,254 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2021-08-25 20:31:10,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2021-08-25 20:31:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-25 20:31:10,256 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:10,256 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:10,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:31:10,257 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash -589138407, now seen corresponding path program 1 times [2021-08-25 20:31:10,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:10,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306975622] [2021-08-25 20:31:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:10,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:10,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:10,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306975622] [2021-08-25 20:31:10,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306975622] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:10,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:10,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:10,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215071205] [2021-08-25 20:31:10,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:10,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:10,387 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:10,713 INFO L93 Difference]: Finished difference Result 284 states and 431 transitions. [2021-08-25 20:31:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:10,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-08-25 20:31:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:10,715 INFO L225 Difference]: With dead ends: 284 [2021-08-25 20:31:10,715 INFO L226 Difference]: Without dead ends: 160 [2021-08-25 20:31:10,716 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-25 20:31:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-08-25 20:31:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 142 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2021-08-25 20:31:10,725 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 54 [2021-08-25 20:31:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:10,726 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2021-08-25 20:31:10,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2021-08-25 20:31:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:31:10,727 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:10,728 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:10,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:31:10,728 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:10,729 INFO L82 PathProgramCache]: Analyzing trace with hash -873991893, now seen corresponding path program 1 times [2021-08-25 20:31:10,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:10,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380747917] [2021-08-25 20:31:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:10,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:10,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:10,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380747917] [2021-08-25 20:31:10,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380747917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:10,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:10,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:10,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348759074] [2021-08-25 20:31:10,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:10,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:10,811 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:11,098 INFO L93 Difference]: Finished difference Result 283 states and 429 transitions. [2021-08-25 20:31:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:11,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-25 20:31:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:11,100 INFO L225 Difference]: With dead ends: 283 [2021-08-25 20:31:11,100 INFO L226 Difference]: Without dead ends: 159 [2021-08-25 20:31:11,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-25 20:31:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-08-25 20:31:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2021-08-25 20:31:11,108 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 55 [2021-08-25 20:31:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:11,108 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2021-08-25 20:31:11,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2021-08-25 20:31:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:31:11,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:11,110 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:11,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:31:11,111 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2010193898, now seen corresponding path program 1 times [2021-08-25 20:31:11,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:11,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996710161] [2021-08-25 20:31:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:11,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:11,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:11,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996710161] [2021-08-25 20:31:11,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996710161] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:11,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:11,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:11,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314320289] [2021-08-25 20:31:11,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:11,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:11,181 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:11,447 INFO L93 Difference]: Finished difference Result 281 states and 426 transitions. [2021-08-25 20:31:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:11,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-25 20:31:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:11,449 INFO L225 Difference]: With dead ends: 281 [2021-08-25 20:31:11,449 INFO L226 Difference]: Without dead ends: 157 [2021-08-25 20:31:11,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-25 20:31:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2021-08-25 20:31:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2021-08-25 20:31:11,456 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 55 [2021-08-25 20:31:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:11,456 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2021-08-25 20:31:11,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2021-08-25 20:31:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:31:11,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:11,458 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:11,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:31:11,458 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1549428566, now seen corresponding path program 1 times [2021-08-25 20:31:11,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:11,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985828937] [2021-08-25 20:31:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:11,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:11,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:11,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985828937] [2021-08-25 20:31:11,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985828937] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:11,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:11,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:11,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232127325] [2021-08-25 20:31:11,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:11,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:11,538 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:11,774 INFO L93 Difference]: Finished difference Result 280 states and 424 transitions. [2021-08-25 20:31:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-25 20:31:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:11,776 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:31:11,776 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:31:11,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:31:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:31:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 142 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2021-08-25 20:31:11,782 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 55 [2021-08-25 20:31:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:11,782 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2021-08-25 20:31:11,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2021-08-25 20:31:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:31:11,783 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:11,783 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:11,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:31:11,784 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1877613889, now seen corresponding path program 1 times [2021-08-25 20:31:11,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:11,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384259211] [2021-08-25 20:31:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:11,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:11,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:11,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384259211] [2021-08-25 20:31:11,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384259211] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:11,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:11,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:11,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453398597] [2021-08-25 20:31:11,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:11,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:11,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:11,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:11,863 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:12,078 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2021-08-25 20:31:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-25 20:31:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:12,080 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:31:12,080 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:31:12,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:31:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:31:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 142 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2021-08-25 20:31:12,085 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 55 [2021-08-25 20:31:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:12,086 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2021-08-25 20:31:12,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2021-08-25 20:31:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-25 20:31:12,086 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:12,087 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:12,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:31:12,087 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash 559324962, now seen corresponding path program 1 times [2021-08-25 20:31:12,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:12,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784594643] [2021-08-25 20:31:12,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:12,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:12,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:12,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784594643] [2021-08-25 20:31:12,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784594643] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:12,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:12,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:12,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929594522] [2021-08-25 20:31:12,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:12,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:12,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:12,142 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:12,377 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2021-08-25 20:31:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:12,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-08-25 20:31:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:12,379 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:31:12,379 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:31:12,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:31:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:31:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2021-08-25 20:31:12,384 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 56 [2021-08-25 20:31:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:12,384 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2021-08-25 20:31:12,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2021-08-25 20:31:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:31:12,385 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:12,385 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:12,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:31:12,386 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:12,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1118749788, now seen corresponding path program 1 times [2021-08-25 20:31:12,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:12,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069492917] [2021-08-25 20:31:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:12,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:12,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:12,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069492917] [2021-08-25 20:31:12,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069492917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:12,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:12,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:12,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823950999] [2021-08-25 20:31:12,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:12,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:12,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:12,436 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:12,667 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2021-08-25 20:31:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:12,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-08-25 20:31:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:12,669 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:31:12,669 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:31:12,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:31:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:31:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2021-08-25 20:31:12,673 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 57 [2021-08-25 20:31:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:12,673 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2021-08-25 20:31:12,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2021-08-25 20:31:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:31:12,674 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:12,674 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:12,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:31:12,675 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:12,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1513227289, now seen corresponding path program 1 times [2021-08-25 20:31:12,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:12,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484574912] [2021-08-25 20:31:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:12,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:12,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:12,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484574912] [2021-08-25 20:31:12,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484574912] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:12,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:12,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:12,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020919868] [2021-08-25 20:31:12,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:12,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:12,721 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:12,948 INFO L93 Difference]: Finished difference Result 270 states and 407 transitions. [2021-08-25 20:31:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-08-25 20:31:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:12,950 INFO L225 Difference]: With dead ends: 270 [2021-08-25 20:31:12,950 INFO L226 Difference]: Without dead ends: 146 [2021-08-25 20:31:12,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-08-25 20:31:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2021-08-25 20:31:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4929577464788732) internal successors, (212), 142 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2021-08-25 20:31:12,954 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 58 [2021-08-25 20:31:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:12,954 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2021-08-25 20:31:12,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2021-08-25 20:31:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:31:12,955 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:12,955 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:12,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:31:12,955 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash -383138993, now seen corresponding path program 1 times [2021-08-25 20:31:12,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:12,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558253810] [2021-08-25 20:31:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:12,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:13,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:13,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558253810] [2021-08-25 20:31:13,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558253810] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:13,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:13,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:13,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390109277] [2021-08-25 20:31:13,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:13,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:13,057 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:13,299 INFO L93 Difference]: Finished difference Result 310 states and 468 transitions. [2021-08-25 20:31:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:13,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-08-25 20:31:13,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:13,301 INFO L225 Difference]: With dead ends: 310 [2021-08-25 20:31:13,301 INFO L226 Difference]: Without dead ends: 186 [2021-08-25 20:31:13,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-25 20:31:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-08-25 20:31:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.524390243902439) internal successors, (250), 164 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2021-08-25 20:31:13,305 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 58 [2021-08-25 20:31:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:13,306 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2021-08-25 20:31:13,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2021-08-25 20:31:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-25 20:31:13,306 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:13,307 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:13,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:31:13,307 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1542897590, now seen corresponding path program 1 times [2021-08-25 20:31:13,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:13,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967265853] [2021-08-25 20:31:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:13,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:13,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:13,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967265853] [2021-08-25 20:31:13,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967265853] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:13,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:13,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:13,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126645643] [2021-08-25 20:31:13,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:13,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:13,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:13,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:13,380 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:13,612 INFO L93 Difference]: Finished difference Result 332 states and 505 transitions. [2021-08-25 20:31:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:13,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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) Word has length 71 [2021-08-25 20:31:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:13,614 INFO L225 Difference]: With dead ends: 332 [2021-08-25 20:31:13,614 INFO L226 Difference]: Without dead ends: 186 [2021-08-25 20:31:13,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-25 20:31:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-08-25 20:31:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 164 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2021-08-25 20:31:13,618 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 71 [2021-08-25 20:31:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:13,619 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2021-08-25 20:31:13,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2021-08-25 20:31:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:31:13,620 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:13,620 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:13,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:31:13,620 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:13,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:13,621 INFO L82 PathProgramCache]: Analyzing trace with hash -375755494, now seen corresponding path program 1 times [2021-08-25 20:31:13,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:13,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423530482] [2021-08-25 20:31:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:13,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:13,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:13,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423530482] [2021-08-25 20:31:13,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423530482] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:13,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:13,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:13,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047013348] [2021-08-25 20:31:13,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:13,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:13,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:13,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:13,681 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:13,909 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2021-08-25 20:31:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-08-25 20:31:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:13,911 INFO L225 Difference]: With dead ends: 331 [2021-08-25 20:31:13,911 INFO L226 Difference]: Without dead ends: 185 [2021-08-25 20:31:13,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-25 20:31:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2021-08-25 20:31:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2021-08-25 20:31:13,923 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 72 [2021-08-25 20:31:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:13,924 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2021-08-25 20:31:13,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2021-08-25 20:31:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:31:13,925 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:13,925 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:13,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:31:13,926 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:13,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1511957499, now seen corresponding path program 1 times [2021-08-25 20:31:13,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:13,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954275299] [2021-08-25 20:31:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:13,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:13,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:13,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954275299] [2021-08-25 20:31:13,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954275299] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:13,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:13,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:13,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457762005] [2021-08-25 20:31:13,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:13,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:13,968 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:14,186 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2021-08-25 20:31:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-08-25 20:31:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:14,187 INFO L225 Difference]: With dead ends: 329 [2021-08-25 20:31:14,187 INFO L226 Difference]: Without dead ends: 183 [2021-08-25 20:31:14,188 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-08-25 20:31:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2021-08-25 20:31:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2021-08-25 20:31:14,194 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 72 [2021-08-25 20:31:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:14,195 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2021-08-25 20:31:14,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2021-08-25 20:31:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:31:14,195 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:14,195 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:14,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:31:14,196 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2047664965, now seen corresponding path program 1 times [2021-08-25 20:31:14,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:14,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055360095] [2021-08-25 20:31:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:14,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:14,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:14,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055360095] [2021-08-25 20:31:14,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055360095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:14,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:14,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:14,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142604787] [2021-08-25 20:31:14,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:14,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:14,245 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:14,469 INFO L93 Difference]: Finished difference Result 328 states and 495 transitions. [2021-08-25 20:31:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:14,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-08-25 20:31:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:14,470 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:31:14,471 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:31:14,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:31:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:31:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2021-08-25 20:31:14,474 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 72 [2021-08-25 20:31:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:14,474 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-08-25 20:31:14,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2021-08-25 20:31:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:31:14,475 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:14,475 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:14,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:31:14,476 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:14,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1379377490, now seen corresponding path program 1 times [2021-08-25 20:31:14,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:14,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988745345] [2021-08-25 20:31:14,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:14,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:14,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:14,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988745345] [2021-08-25 20:31:14,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988745345] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:14,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:14,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:14,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22818562] [2021-08-25 20:31:14,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:14,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:14,516 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:14,732 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2021-08-25 20:31:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-08-25 20:31:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:14,733 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:31:14,734 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:31:14,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:31:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:31:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4939024390243902) internal successors, (245), 164 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2021-08-25 20:31:14,738 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 72 [2021-08-25 20:31:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:14,738 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2021-08-25 20:31:14,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2021-08-25 20:31:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-25 20:31:14,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:14,739 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:14,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:31:14,739 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1175215853, now seen corresponding path program 1 times [2021-08-25 20:31:14,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:14,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611345214] [2021-08-25 20:31:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:14,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:14,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:14,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611345214] [2021-08-25 20:31:14,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611345214] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:14,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:14,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:14,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207752250] [2021-08-25 20:31:14,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:14,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:14,776 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:15,015 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2021-08-25 20:31:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-08-25 20:31:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:15,017 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:31:15,017 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:31:15,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:31:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:31:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2021-08-25 20:31:15,021 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 73 [2021-08-25 20:31:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:15,021 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2021-08-25 20:31:15,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2021-08-25 20:31:15,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:31:15,022 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:15,022 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:15,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:31:15,023 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:15,023 INFO L82 PathProgramCache]: Analyzing trace with hash 945059795, now seen corresponding path program 1 times [2021-08-25 20:31:15,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:15,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073584683] [2021-08-25 20:31:15,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:15,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:15,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:15,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073584683] [2021-08-25 20:31:15,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073584683] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:15,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:15,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:15,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640866269] [2021-08-25 20:31:15,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:15,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:15,071 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:15,287 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2021-08-25 20:31:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:15,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-08-25 20:31:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:15,288 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:31:15,288 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:31:15,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:31:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:31:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 164 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2021-08-25 20:31:15,291 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 74 [2021-08-25 20:31:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:15,292 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2021-08-25 20:31:15,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2021-08-25 20:31:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:31:15,292 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:15,293 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:15,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:31:15,293 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1959639656, now seen corresponding path program 1 times [2021-08-25 20:31:15,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:15,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709050660] [2021-08-25 20:31:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:15,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:15,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:15,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709050660] [2021-08-25 20:31:15,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709050660] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:15,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:15,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:15,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122379441] [2021-08-25 20:31:15,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:15,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:15,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:15,341 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:15,545 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2021-08-25 20:31:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-08-25 20:31:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:15,547 INFO L225 Difference]: With dead ends: 318 [2021-08-25 20:31:15,547 INFO L226 Difference]: Without dead ends: 172 [2021-08-25 20:31:15,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-25 20:31:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2021-08-25 20:31:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.475609756097561) internal successors, (242), 164 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2021-08-25 20:31:15,551 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 75 [2021-08-25 20:31:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:15,551 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2021-08-25 20:31:15,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2021-08-25 20:31:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-25 20:31:15,552 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:15,552 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:15,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:31:15,554 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1761634740, now seen corresponding path program 1 times [2021-08-25 20:31:15,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:15,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801987638] [2021-08-25 20:31:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:15,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:15,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:15,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801987638] [2021-08-25 20:31:15,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801987638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:15,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:15,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:15,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725681984] [2021-08-25 20:31:15,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:15,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:15,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:15,632 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:15,987 INFO L93 Difference]: Finished difference Result 416 states and 623 transitions. [2021-08-25 20:31:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 80 [2021-08-25 20:31:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:15,989 INFO L225 Difference]: With dead ends: 416 [2021-08-25 20:31:15,989 INFO L226 Difference]: Without dead ends: 270 [2021-08-25 20:31:15,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-08-25 20:31:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 206. [2021-08-25 20:31:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.5414634146341464) internal successors, (316), 205 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2021-08-25 20:31:15,994 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 80 [2021-08-25 20:31:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:15,995 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2021-08-25 20:31:15,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2021-08-25 20:31:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-25 20:31:15,995 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:15,996 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:15,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:31:15,996 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -83732426, now seen corresponding path program 1 times [2021-08-25 20:31:15,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:15,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725399876] [2021-08-25 20:31:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:15,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:16,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:16,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725399876] [2021-08-25 20:31:16,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725399876] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:16,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:16,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:16,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704890748] [2021-08-25 20:31:16,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:16,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:16,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:16,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:16,041 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:16,320 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2021-08-25 20:31:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 80 [2021-08-25 20:31:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:16,321 INFO L225 Difference]: With dead ends: 442 [2021-08-25 20:31:16,322 INFO L226 Difference]: Without dead ends: 255 [2021-08-25 20:31:16,322 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-25 20:31:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2021-08-25 20:31:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5633187772925765) internal successors, (358), 229 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2021-08-25 20:31:16,327 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 80 [2021-08-25 20:31:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:16,327 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2021-08-25 20:31:16,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2021-08-25 20:31:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-25 20:31:16,328 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:16,328 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:16,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:31:16,328 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:16,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1230430550, now seen corresponding path program 1 times [2021-08-25 20:31:16,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:16,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250067182] [2021-08-25 20:31:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:16,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:16,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:16,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250067182] [2021-08-25 20:31:16,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250067182] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:16,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:16,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:16,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044627173] [2021-08-25 20:31:16,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:16,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:16,386 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:16,727 INFO L93 Difference]: Finished difference Result 499 states and 773 transitions. [2021-08-25 20:31:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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) Word has length 81 [2021-08-25 20:31:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:16,729 INFO L225 Difference]: With dead ends: 499 [2021-08-25 20:31:16,729 INFO L226 Difference]: Without dead ends: 288 [2021-08-25 20:31:16,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-25 20:31:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2021-08-25 20:31:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5608695652173914) internal successors, (359), 230 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 359 transitions. [2021-08-25 20:31:16,734 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 359 transitions. Word has length 81 [2021-08-25 20:31:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:16,734 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 359 transitions. [2021-08-25 20:31:16,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 359 transitions. [2021-08-25 20:31:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-25 20:31:16,735 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:16,735 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:16,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:31:16,735 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash -47127035, now seen corresponding path program 1 times [2021-08-25 20:31:16,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:16,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689835753] [2021-08-25 20:31:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:16,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:16,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:16,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689835753] [2021-08-25 20:31:16,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689835753] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:16,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:16,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:16,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437039922] [2021-08-25 20:31:16,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:16,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:16,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:16,784 INFO L87 Difference]: Start difference. First operand 231 states and 359 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:17,150 INFO L93 Difference]: Finished difference Result 500 states and 773 transitions. [2021-08-25 20:31:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 93 [2021-08-25 20:31:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:17,152 INFO L225 Difference]: With dead ends: 500 [2021-08-25 20:31:17,152 INFO L226 Difference]: Without dead ends: 288 [2021-08-25 20:31:17,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-25 20:31:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2021-08-25 20:31:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5565217391304347) internal successors, (358), 230 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 358 transitions. [2021-08-25 20:31:17,157 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 358 transitions. Word has length 93 [2021-08-25 20:31:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:17,158 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 358 transitions. [2021-08-25 20:31:17,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 358 transitions. [2021-08-25 20:31:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-25 20:31:17,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:17,159 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:17,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:31:17,159 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1491212995, now seen corresponding path program 1 times [2021-08-25 20:31:17,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:17,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740004814] [2021-08-25 20:31:17,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:17,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:17,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:17,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740004814] [2021-08-25 20:31:17,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740004814] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:17,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:17,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:17,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988321332] [2021-08-25 20:31:17,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:17,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:17,211 INFO L87 Difference]: Start difference. First operand 231 states and 358 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:17,476 INFO L93 Difference]: Finished difference Result 468 states and 726 transitions. [2021-08-25 20:31:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 93 [2021-08-25 20:31:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:17,478 INFO L225 Difference]: With dead ends: 468 [2021-08-25 20:31:17,478 INFO L226 Difference]: Without dead ends: 256 [2021-08-25 20:31:17,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-25 20:31:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2021-08-25 20:31:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5521739130434782) internal successors, (357), 230 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 357 transitions. [2021-08-25 20:31:17,483 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 357 transitions. Word has length 93 [2021-08-25 20:31:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:17,484 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 357 transitions. [2021-08-25 20:31:17,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 357 transitions. [2021-08-25 20:31:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:31:17,485 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:17,485 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:17,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:31:17,486 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1251508545, now seen corresponding path program 1 times [2021-08-25 20:31:17,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:17,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616305295] [2021-08-25 20:31:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:17,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:17,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:17,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616305295] [2021-08-25 20:31:17,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616305295] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:17,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:17,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:17,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275893564] [2021-08-25 20:31:17,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:17,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:17,534 INFO L87 Difference]: Start difference. First operand 231 states and 357 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:17,880 INFO L93 Difference]: Finished difference Result 499 states and 768 transitions. [2021-08-25 20:31:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 94 [2021-08-25 20:31:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:17,881 INFO L225 Difference]: With dead ends: 499 [2021-08-25 20:31:17,881 INFO L226 Difference]: Without dead ends: 287 [2021-08-25 20:31:17,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-08-25 20:31:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 231. [2021-08-25 20:31:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5478260869565217) internal successors, (356), 230 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 356 transitions. [2021-08-25 20:31:17,887 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 356 transitions. Word has length 94 [2021-08-25 20:31:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:17,887 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 356 transitions. [2021-08-25 20:31:17,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 356 transitions. [2021-08-25 20:31:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:31:17,889 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:17,889 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:17,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:31:17,889 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1907256746, now seen corresponding path program 1 times [2021-08-25 20:31:17,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:17,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778664166] [2021-08-25 20:31:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:17,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:17,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:17,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778664166] [2021-08-25 20:31:17,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778664166] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:17,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:17,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:17,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448703455] [2021-08-25 20:31:17,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:17,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:17,940 INFO L87 Difference]: Start difference. First operand 231 states and 356 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:18,253 INFO L93 Difference]: Finished difference Result 497 states and 764 transitions. [2021-08-25 20:31:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 94 [2021-08-25 20:31:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:18,254 INFO L225 Difference]: With dead ends: 497 [2021-08-25 20:31:18,255 INFO L226 Difference]: Without dead ends: 285 [2021-08-25 20:31:18,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-08-25 20:31:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 231. [2021-08-25 20:31:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5434782608695652) internal successors, (355), 230 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 355 transitions. [2021-08-25 20:31:18,260 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 355 transitions. Word has length 94 [2021-08-25 20:31:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:18,260 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 355 transitions. [2021-08-25 20:31:18,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 355 transitions. [2021-08-25 20:31:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:31:18,261 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:18,261 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:18,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:31:18,262 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1171911914, now seen corresponding path program 1 times [2021-08-25 20:31:18,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:18,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977295547] [2021-08-25 20:31:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:18,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:18,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:18,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977295547] [2021-08-25 20:31:18,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977295547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:18,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:18,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:18,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070447283] [2021-08-25 20:31:18,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:18,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:18,307 INFO L87 Difference]: Start difference. First operand 231 states and 355 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:18,630 INFO L93 Difference]: Finished difference Result 496 states and 761 transitions. [2021-08-25 20:31:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:18,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 94 [2021-08-25 20:31:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:18,632 INFO L225 Difference]: With dead ends: 496 [2021-08-25 20:31:18,632 INFO L226 Difference]: Without dead ends: 284 [2021-08-25 20:31:18,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-08-25 20:31:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 231. [2021-08-25 20:31:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5391304347826087) internal successors, (354), 230 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 354 transitions. [2021-08-25 20:31:18,639 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 354 transitions. Word has length 94 [2021-08-25 20:31:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:18,639 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 354 transitions. [2021-08-25 20:31:18,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 354 transitions. [2021-08-25 20:31:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:31:18,640 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:18,640 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:18,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:31:18,641 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2039836755, now seen corresponding path program 1 times [2021-08-25 20:31:18,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:18,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296256560] [2021-08-25 20:31:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:18,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-25 20:31:18,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:18,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296256560] [2021-08-25 20:31:18,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296256560] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:18,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:18,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:31:18,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798641110] [2021-08-25 20:31:18,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:31:18,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:31:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:18,714 INFO L87 Difference]: Start difference. First operand 231 states and 354 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-08-25 20:31:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:19,039 INFO L93 Difference]: Finished difference Result 464 states and 716 transitions. [2021-08-25 20:31:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:31:19,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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) Word has length 94 [2021-08-25 20:31:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:19,040 INFO L225 Difference]: With dead ends: 464 [2021-08-25 20:31:19,040 INFO L226 Difference]: Without dead ends: 252 [2021-08-25 20:31:19,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.3ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:31:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-08-25 20:31:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2021-08-25 20:31:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.52) internal successors, (380), 250 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 380 transitions. [2021-08-25 20:31:19,046 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 380 transitions. Word has length 94 [2021-08-25 20:31:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:19,047 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 380 transitions. [2021-08-25 20:31:19,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-08-25 20:31:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 380 transitions. [2021-08-25 20:31:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:31:19,048 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:19,048 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:19,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:31:19,049 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1943809876, now seen corresponding path program 1 times [2021-08-25 20:31:19,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:19,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309377053] [2021-08-25 20:31:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:19,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:19,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:19,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309377053] [2021-08-25 20:31:19,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309377053] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:19,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:19,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:19,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151880265] [2021-08-25 20:31:19,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:19,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:19,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:19,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:19,093 INFO L87 Difference]: Start difference. First operand 251 states and 380 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:19,339 INFO L93 Difference]: Finished difference Result 505 states and 766 transitions. [2021-08-25 20:31:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:19,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 94 [2021-08-25 20:31:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:19,340 INFO L225 Difference]: With dead ends: 505 [2021-08-25 20:31:19,340 INFO L226 Difference]: Without dead ends: 273 [2021-08-25 20:31:19,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-25 20:31:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 251. [2021-08-25 20:31:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.516) internal successors, (379), 250 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2021-08-25 20:31:19,346 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 94 [2021-08-25 20:31:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:19,347 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2021-08-25 20:31:19,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2021-08-25 20:31:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:31:19,348 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:19,348 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:19,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:31:19,349 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1615812588, now seen corresponding path program 1 times [2021-08-25 20:31:19,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:19,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978803993] [2021-08-25 20:31:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:19,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:19,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:19,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978803993] [2021-08-25 20:31:19,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978803993] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:19,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:19,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:19,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613965110] [2021-08-25 20:31:19,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:19,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:19,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:19,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:19,395 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:19,633 INFO L93 Difference]: Finished difference Result 504 states and 763 transitions. [2021-08-25 20:31:19,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:19,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 94 [2021-08-25 20:31:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:19,635 INFO L225 Difference]: With dead ends: 504 [2021-08-25 20:31:19,635 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:31:19,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:31:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2021-08-25 20:31:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.512) internal successors, (378), 250 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 378 transitions. [2021-08-25 20:31:19,640 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 378 transitions. Word has length 94 [2021-08-25 20:31:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:19,641 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 378 transitions. [2021-08-25 20:31:19,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 378 transitions. [2021-08-25 20:31:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-25 20:31:19,641 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:19,641 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:19,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:31:19,642 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:19,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1225694591, now seen corresponding path program 1 times [2021-08-25 20:31:19,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:19,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555731966] [2021-08-25 20:31:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:19,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:19,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:19,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555731966] [2021-08-25 20:31:19,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555731966] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:19,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:19,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:19,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249835150] [2021-08-25 20:31:19,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:19,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:19,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:19,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:19,697 INFO L87 Difference]: Start difference. First operand 251 states and 378 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-08-25 20:31:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:19,991 INFO L93 Difference]: Finished difference Result 536 states and 806 transitions. [2021-08-25 20:31:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:19,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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) Word has length 95 [2021-08-25 20:31:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:19,993 INFO L225 Difference]: With dead ends: 536 [2021-08-25 20:31:19,993 INFO L226 Difference]: Without dead ends: 304 [2021-08-25 20:31:19,994 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-08-25 20:31:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2021-08-25 20:31:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.508) internal successors, (377), 250 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 377 transitions. [2021-08-25 20:31:20,009 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 377 transitions. Word has length 95 [2021-08-25 20:31:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:20,010 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 377 transitions. [2021-08-25 20:31:20,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-08-25 20:31:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 377 transitions. [2021-08-25 20:31:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-25 20:31:20,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:20,011 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:20,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:31:20,011 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -349675585, now seen corresponding path program 1 times [2021-08-25 20:31:20,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:20,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630272096] [2021-08-25 20:31:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:20,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:20,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:20,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630272096] [2021-08-25 20:31:20,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630272096] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:20,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:20,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:20,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804756003] [2021-08-25 20:31:20,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:20,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:20,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:20,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:20,070 INFO L87 Difference]: Start difference. First operand 251 states and 377 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-08-25 20:31:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:20,304 INFO L93 Difference]: Finished difference Result 504 states and 759 transitions. [2021-08-25 20:31:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:20,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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) Word has length 95 [2021-08-25 20:31:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:20,306 INFO L225 Difference]: With dead ends: 504 [2021-08-25 20:31:20,306 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:31:20,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:31:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2021-08-25 20:31:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.504) internal successors, (376), 250 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 376 transitions. [2021-08-25 20:31:20,311 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 376 transitions. Word has length 95 [2021-08-25 20:31:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:20,312 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 376 transitions. [2021-08-25 20:31:20,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-08-25 20:31:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 376 transitions. [2021-08-25 20:31:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:31:20,313 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:20,313 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:20,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:31:20,314 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1893169626, now seen corresponding path program 1 times [2021-08-25 20:31:20,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:20,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239391896] [2021-08-25 20:31:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:20,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:20,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:20,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239391896] [2021-08-25 20:31:20,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239391896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:20,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:20,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:20,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450167782] [2021-08-25 20:31:20,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:20,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:20,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:20,360 INFO L87 Difference]: Start difference. First operand 251 states and 376 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:20,667 INFO L93 Difference]: Finished difference Result 536 states and 802 transitions. [2021-08-25 20:31:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:20,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 96 [2021-08-25 20:31:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:20,669 INFO L225 Difference]: With dead ends: 536 [2021-08-25 20:31:20,669 INFO L226 Difference]: Without dead ends: 304 [2021-08-25 20:31:20,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-08-25 20:31:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2021-08-25 20:31:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.5) internal successors, (375), 250 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 375 transitions. [2021-08-25 20:31:20,675 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 375 transitions. Word has length 96 [2021-08-25 20:31:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:20,675 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 375 transitions. [2021-08-25 20:31:20,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 375 transitions. [2021-08-25 20:31:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-08-25 20:31:20,676 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:20,676 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:20,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:31:20,678 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:20,678 INFO L82 PathProgramCache]: Analyzing trace with hash -506384216, now seen corresponding path program 1 times [2021-08-25 20:31:20,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:20,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99944766] [2021-08-25 20:31:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:20,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:20,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:20,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99944766] [2021-08-25 20:31:20,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99944766] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:20,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:20,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:20,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329239976] [2021-08-25 20:31:20,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:20,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:20,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:20,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:20,723 INFO L87 Difference]: Start difference. First operand 251 states and 375 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:20,968 INFO L93 Difference]: Finished difference Result 504 states and 755 transitions. [2021-08-25 20:31:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:20,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 96 [2021-08-25 20:31:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:20,970 INFO L225 Difference]: With dead ends: 504 [2021-08-25 20:31:20,970 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:31:20,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:31:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2021-08-25 20:31:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.496) internal successors, (374), 250 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 374 transitions. [2021-08-25 20:31:20,975 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 374 transitions. Word has length 96 [2021-08-25 20:31:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:20,976 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 374 transitions. [2021-08-25 20:31:20,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 374 transitions. [2021-08-25 20:31:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:31:20,979 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:20,979 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:20,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:31:20,979 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:20,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1563138876, now seen corresponding path program 1 times [2021-08-25 20:31:20,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:20,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927874412] [2021-08-25 20:31:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:20,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:21,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:21,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927874412] [2021-08-25 20:31:21,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927874412] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:21,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:21,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:21,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743384147] [2021-08-25 20:31:21,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:21,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:21,025 INFO L87 Difference]: Start difference. First operand 251 states and 374 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:21,337 INFO L93 Difference]: Finished difference Result 536 states and 798 transitions. [2021-08-25 20:31:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:21,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 97 [2021-08-25 20:31:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:21,339 INFO L225 Difference]: With dead ends: 536 [2021-08-25 20:31:21,339 INFO L226 Difference]: Without dead ends: 304 [2021-08-25 20:31:21,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-08-25 20:31:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2021-08-25 20:31:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.492) internal successors, (373), 250 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2021-08-25 20:31:21,345 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 97 [2021-08-25 20:31:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:21,346 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2021-08-25 20:31:21,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2021-08-25 20:31:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:31:21,347 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:21,347 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:21,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:31:21,347 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:21,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1603813626, now seen corresponding path program 1 times [2021-08-25 20:31:21,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:21,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870116184] [2021-08-25 20:31:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:21,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:21,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:21,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870116184] [2021-08-25 20:31:21,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870116184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:21,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:21,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:21,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995291562] [2021-08-25 20:31:21,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:21,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:21,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:21,394 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:21,639 INFO L93 Difference]: Finished difference Result 504 states and 751 transitions. [2021-08-25 20:31:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:21,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 97 [2021-08-25 20:31:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:21,641 INFO L225 Difference]: With dead ends: 504 [2021-08-25 20:31:21,641 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:31:21,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:31:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2021-08-25 20:31:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.488) internal successors, (372), 250 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 372 transitions. [2021-08-25 20:31:21,654 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 372 transitions. Word has length 97 [2021-08-25 20:31:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:21,654 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 372 transitions. [2021-08-25 20:31:21,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 372 transitions. [2021-08-25 20:31:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:31:21,655 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:21,655 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:21,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:31:21,656 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:21,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash -287249151, now seen corresponding path program 1 times [2021-08-25 20:31:21,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:21,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836439019] [2021-08-25 20:31:21,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:21,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:21,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:21,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836439019] [2021-08-25 20:31:21,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836439019] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:21,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:21,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:21,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529974593] [2021-08-25 20:31:21,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:21,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:21,719 INFO L87 Difference]: Start difference. First operand 251 states and 372 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:22,015 INFO L93 Difference]: Finished difference Result 526 states and 782 transitions. [2021-08-25 20:31:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:22,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 98 [2021-08-25 20:31:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:22,017 INFO L225 Difference]: With dead ends: 526 [2021-08-25 20:31:22,017 INFO L226 Difference]: Without dead ends: 294 [2021-08-25 20:31:22,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-08-25 20:31:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 251. [2021-08-25 20:31:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.484) internal successors, (371), 250 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 371 transitions. [2021-08-25 20:31:22,024 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 371 transitions. Word has length 98 [2021-08-25 20:31:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:22,024 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 371 transitions. [2021-08-25 20:31:22,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 371 transitions. [2021-08-25 20:31:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:31:22,025 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:22,025 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:22,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:31:22,026 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash 973668099, now seen corresponding path program 1 times [2021-08-25 20:31:22,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:22,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881626661] [2021-08-25 20:31:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:22,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:22,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:22,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881626661] [2021-08-25 20:31:22,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881626661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:22,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:22,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:22,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986394653] [2021-08-25 20:31:22,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:22,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:22,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:22,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:22,092 INFO L87 Difference]: Start difference. First operand 251 states and 371 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:22,323 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2021-08-25 20:31:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 98 [2021-08-25 20:31:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:22,325 INFO L225 Difference]: With dead ends: 494 [2021-08-25 20:31:22,325 INFO L226 Difference]: Without dead ends: 262 [2021-08-25 20:31:22,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-25 20:31:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 251. [2021-08-25 20:31:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.48) internal successors, (370), 250 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 370 transitions. [2021-08-25 20:31:22,331 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 370 transitions. Word has length 98 [2021-08-25 20:31:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:22,331 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 370 transitions. [2021-08-25 20:31:22,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 370 transitions. [2021-08-25 20:31:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:31:22,332 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:22,332 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:22,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:31:22,332 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1584535859, now seen corresponding path program 1 times [2021-08-25 20:31:22,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:22,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641905780] [2021-08-25 20:31:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:22,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:22,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:22,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641905780] [2021-08-25 20:31:22,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641905780] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:22,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:22,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:22,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295406491] [2021-08-25 20:31:22,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:22,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:22,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:22,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:22,383 INFO L87 Difference]: Start difference. First operand 251 states and 370 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:22,679 INFO L93 Difference]: Finished difference Result 526 states and 778 transitions. [2021-08-25 20:31:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:22,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 102 [2021-08-25 20:31:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:22,681 INFO L225 Difference]: With dead ends: 526 [2021-08-25 20:31:22,681 INFO L226 Difference]: Without dead ends: 294 [2021-08-25 20:31:22,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-08-25 20:31:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 251. [2021-08-25 20:31:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.476) internal successors, (369), 250 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 369 transitions. [2021-08-25 20:31:22,687 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 369 transitions. Word has length 102 [2021-08-25 20:31:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:22,688 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 369 transitions. [2021-08-25 20:31:22,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 369 transitions. [2021-08-25 20:31:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:31:22,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:22,689 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:22,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:31:22,689 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 377038799, now seen corresponding path program 1 times [2021-08-25 20:31:22,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:22,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35671585] [2021-08-25 20:31:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:22,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:22,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:22,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35671585] [2021-08-25 20:31:22,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35671585] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:22,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:22,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:22,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412541844] [2021-08-25 20:31:22,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:22,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:22,740 INFO L87 Difference]: Start difference. First operand 251 states and 369 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:22,995 INFO L93 Difference]: Finished difference Result 535 states and 795 transitions. [2021-08-25 20:31:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:22,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 102 [2021-08-25 20:31:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:22,997 INFO L225 Difference]: With dead ends: 535 [2021-08-25 20:31:22,997 INFO L226 Difference]: Without dead ends: 303 [2021-08-25 20:31:22,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-25 20:31:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 277. [2021-08-25 20:31:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.5) internal successors, (414), 276 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 414 transitions. [2021-08-25 20:31:23,004 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 414 transitions. Word has length 102 [2021-08-25 20:31:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:23,004 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 414 transitions. [2021-08-25 20:31:23,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 414 transitions. [2021-08-25 20:31:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:31:23,005 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:23,005 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:23,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:31:23,005 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1906049320, now seen corresponding path program 1 times [2021-08-25 20:31:23,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:23,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535298959] [2021-08-25 20:31:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:23,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:23,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:23,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535298959] [2021-08-25 20:31:23,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535298959] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:23,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:23,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:23,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007980293] [2021-08-25 20:31:23,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:23,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:23,053 INFO L87 Difference]: Start difference. First operand 277 states and 414 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:23,338 INFO L93 Difference]: Finished difference Result 578 states and 866 transitions. [2021-08-25 20:31:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:23,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 105 [2021-08-25 20:31:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:23,340 INFO L225 Difference]: With dead ends: 578 [2021-08-25 20:31:23,340 INFO L226 Difference]: Without dead ends: 320 [2021-08-25 20:31:23,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-25 20:31:23,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 277. [2021-08-25 20:31:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4963768115942029) internal successors, (413), 276 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 413 transitions. [2021-08-25 20:31:23,347 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 413 transitions. Word has length 105 [2021-08-25 20:31:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:23,347 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 413 transitions. [2021-08-25 20:31:23,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 413 transitions. [2021-08-25 20:31:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:31:23,348 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:23,349 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:23,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:31:23,350 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash -560376435, now seen corresponding path program 1 times [2021-08-25 20:31:23,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:23,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400807690] [2021-08-25 20:31:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:23,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:23,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:23,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400807690] [2021-08-25 20:31:23,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400807690] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:23,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:23,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:23,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746798880] [2021-08-25 20:31:23,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:23,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:23,402 INFO L87 Difference]: Start difference. First operand 277 states and 413 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-08-25 20:31:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:23,685 INFO L93 Difference]: Finished difference Result 570 states and 851 transitions. [2021-08-25 20:31:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:23,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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) Word has length 106 [2021-08-25 20:31:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:23,687 INFO L225 Difference]: With dead ends: 570 [2021-08-25 20:31:23,687 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:31:23,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:31:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2021-08-25 20:31:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4927536231884058) internal successors, (412), 276 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 412 transitions. [2021-08-25 20:31:23,694 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 412 transitions. Word has length 106 [2021-08-25 20:31:23,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:23,694 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 412 transitions. [2021-08-25 20:31:23,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-08-25 20:31:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 412 transitions. [2021-08-25 20:31:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-25 20:31:23,695 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:23,695 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:23,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:31:23,695 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1855377922, now seen corresponding path program 1 times [2021-08-25 20:31:23,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:23,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862868674] [2021-08-25 20:31:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:23,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:23,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:23,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862868674] [2021-08-25 20:31:23,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862868674] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:23,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:23,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:23,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135287455] [2021-08-25 20:31:23,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:23,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:23,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:23,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:23,747 INFO L87 Difference]: Start difference. First operand 277 states and 412 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:24,044 INFO L93 Difference]: Finished difference Result 570 states and 849 transitions. [2021-08-25 20:31:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 107 [2021-08-25 20:31:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:24,046 INFO L225 Difference]: With dead ends: 570 [2021-08-25 20:31:24,046 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:31:24,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:31:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2021-08-25 20:31:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4891304347826086) internal successors, (411), 276 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 411 transitions. [2021-08-25 20:31:24,052 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 411 transitions. Word has length 107 [2021-08-25 20:31:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:24,052 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 411 transitions. [2021-08-25 20:31:24,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 411 transitions. [2021-08-25 20:31:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-25 20:31:24,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:24,053 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:24,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-25 20:31:24,053 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash 705844290, now seen corresponding path program 1 times [2021-08-25 20:31:24,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:24,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875188881] [2021-08-25 20:31:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:24,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:24,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:24,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875188881] [2021-08-25 20:31:24,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875188881] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:24,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:24,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:24,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642109422] [2021-08-25 20:31:24,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:24,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:24,102 INFO L87 Difference]: Start difference. First operand 277 states and 411 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:24,373 INFO L93 Difference]: Finished difference Result 570 states and 847 transitions. [2021-08-25 20:31:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:24,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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) Word has length 108 [2021-08-25 20:31:24,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:24,374 INFO L225 Difference]: With dead ends: 570 [2021-08-25 20:31:24,374 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:31:24,374 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:31:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2021-08-25 20:31:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4855072463768115) internal successors, (410), 276 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 410 transitions. [2021-08-25 20:31:24,381 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 410 transitions. Word has length 108 [2021-08-25 20:31:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:24,381 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 410 transitions. [2021-08-25 20:31:24,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 410 transitions. [2021-08-25 20:31:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-25 20:31:24,382 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:24,383 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:24,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-25 20:31:24,383 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:24,383 INFO L82 PathProgramCache]: Analyzing trace with hash 71773319, now seen corresponding path program 1 times [2021-08-25 20:31:24,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:24,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144405430] [2021-08-25 20:31:24,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:24,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:24,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:24,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144405430] [2021-08-25 20:31:24,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144405430] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:24,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:24,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:24,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875084200] [2021-08-25 20:31:24,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:24,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:24,429 INFO L87 Difference]: Start difference. First operand 277 states and 410 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:24,674 INFO L93 Difference]: Finished difference Result 568 states and 843 transitions. [2021-08-25 20:31:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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) Word has length 108 [2021-08-25 20:31:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:24,675 INFO L225 Difference]: With dead ends: 568 [2021-08-25 20:31:24,675 INFO L226 Difference]: Without dead ends: 310 [2021-08-25 20:31:24,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-08-25 20:31:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 277. [2021-08-25 20:31:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4818840579710144) internal successors, (409), 276 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 409 transitions. [2021-08-25 20:31:24,682 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 409 transitions. Word has length 108 [2021-08-25 20:31:24,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:24,682 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 409 transitions. [2021-08-25 20:31:24,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 409 transitions. [2021-08-25 20:31:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-25 20:31:24,683 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:24,683 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:24,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-25 20:31:24,683 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash 493695261, now seen corresponding path program 1 times [2021-08-25 20:31:24,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:24,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498470991] [2021-08-25 20:31:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:24,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:24,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:24,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498470991] [2021-08-25 20:31:24,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498470991] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:24,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:24,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:24,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984627245] [2021-08-25 20:31:24,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:24,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:24,728 INFO L87 Difference]: Start difference. First operand 277 states and 409 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:25,000 INFO L93 Difference]: Finished difference Result 566 states and 838 transitions. [2021-08-25 20:31:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:25,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-08-25 20:31:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:25,002 INFO L225 Difference]: With dead ends: 566 [2021-08-25 20:31:25,002 INFO L226 Difference]: Without dead ends: 308 [2021-08-25 20:31:25,003 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-08-25 20:31:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 277. [2021-08-25 20:31:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4782608695652173) internal successors, (408), 276 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 408 transitions. [2021-08-25 20:31:25,009 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 408 transitions. Word has length 109 [2021-08-25 20:31:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:25,009 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 408 transitions. [2021-08-25 20:31:25,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 408 transitions. [2021-08-25 20:31:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-25 20:31:25,010 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:25,010 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:25,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-25 20:31:25,011 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1501118240, now seen corresponding path program 1 times [2021-08-25 20:31:25,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:25,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237587281] [2021-08-25 20:31:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:25,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:25,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:25,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237587281] [2021-08-25 20:31:25,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237587281] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:25,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:25,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:25,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838285496] [2021-08-25 20:31:25,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:25,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:25,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:25,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:25,061 INFO L87 Difference]: Start difference. First operand 277 states and 408 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:25,321 INFO L93 Difference]: Finished difference Result 563 states and 832 transitions. [2021-08-25 20:31:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:25,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-08-25 20:31:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:25,323 INFO L225 Difference]: With dead ends: 563 [2021-08-25 20:31:25,323 INFO L226 Difference]: Without dead ends: 305 [2021-08-25 20:31:25,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-08-25 20:31:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 277. [2021-08-25 20:31:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4746376811594204) internal successors, (407), 276 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 407 transitions. [2021-08-25 20:31:25,331 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 407 transitions. Word has length 109 [2021-08-25 20:31:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:25,332 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 407 transitions. [2021-08-25 20:31:25,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 407 transitions. [2021-08-25 20:31:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-25 20:31:25,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:25,333 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:25,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-25 20:31:25,333 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2063467681, now seen corresponding path program 1 times [2021-08-25 20:31:25,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:25,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364119756] [2021-08-25 20:31:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:25,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:25,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:25,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364119756] [2021-08-25 20:31:25,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364119756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:25,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:25,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:25,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832573524] [2021-08-25 20:31:25,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:25,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:25,380 INFO L87 Difference]: Start difference. First operand 277 states and 407 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:25,599 INFO L93 Difference]: Finished difference Result 563 states and 830 transitions. [2021-08-25 20:31:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 111 [2021-08-25 20:31:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:25,601 INFO L225 Difference]: With dead ends: 563 [2021-08-25 20:31:25,601 INFO L226 Difference]: Without dead ends: 305 [2021-08-25 20:31:25,601 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-08-25 20:31:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 277. [2021-08-25 20:31:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4710144927536233) internal successors, (406), 276 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 406 transitions. [2021-08-25 20:31:25,608 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 406 transitions. Word has length 111 [2021-08-25 20:31:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:25,608 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 406 transitions. [2021-08-25 20:31:25,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 406 transitions. [2021-08-25 20:31:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:31:25,609 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:25,609 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:25,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-25 20:31:25,609 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash 312844043, now seen corresponding path program 1 times [2021-08-25 20:31:25,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:25,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67045232] [2021-08-25 20:31:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:25,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:25,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:25,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67045232] [2021-08-25 20:31:25,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67045232] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:25,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:25,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:25,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422117651] [2021-08-25 20:31:25,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:25,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:25,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:25,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:25,653 INFO L87 Difference]: Start difference. First operand 277 states and 406 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:25,903 INFO L93 Difference]: Finished difference Result 559 states and 823 transitions. [2021-08-25 20:31:25,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:25,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 112 [2021-08-25 20:31:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:25,904 INFO L225 Difference]: With dead ends: 559 [2021-08-25 20:31:25,904 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:31:25,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:31:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2021-08-25 20:31:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4673913043478262) internal successors, (405), 276 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 405 transitions. [2021-08-25 20:31:25,911 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 405 transitions. Word has length 112 [2021-08-25 20:31:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:25,912 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 405 transitions. [2021-08-25 20:31:25,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 405 transitions. [2021-08-25 20:31:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:31:25,913 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:25,913 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:25,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-25 20:31:25,913 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash -692198915, now seen corresponding path program 1 times [2021-08-25 20:31:25,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:25,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509347573] [2021-08-25 20:31:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:25,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:25,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:25,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509347573] [2021-08-25 20:31:25,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509347573] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:25,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:25,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:25,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107094978] [2021-08-25 20:31:25,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:25,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:25,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:25,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:25,965 INFO L87 Difference]: Start difference. First operand 277 states and 405 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:26,218 INFO L93 Difference]: Finished difference Result 559 states and 821 transitions. [2021-08-25 20:31:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 112 [2021-08-25 20:31:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:26,220 INFO L225 Difference]: With dead ends: 559 [2021-08-25 20:31:26,220 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:31:26,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:31:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2021-08-25 20:31:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.463768115942029) internal successors, (404), 276 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 404 transitions. [2021-08-25 20:31:26,229 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 404 transitions. Word has length 112 [2021-08-25 20:31:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:26,229 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 404 transitions. [2021-08-25 20:31:26,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 404 transitions. [2021-08-25 20:31:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-25 20:31:26,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:26,230 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:26,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-25 20:31:26,231 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1497358285, now seen corresponding path program 1 times [2021-08-25 20:31:26,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:26,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51591074] [2021-08-25 20:31:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:26,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:26,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:26,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51591074] [2021-08-25 20:31:26,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51591074] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:26,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:26,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:26,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656107084] [2021-08-25 20:31:26,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:26,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:26,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:26,278 INFO L87 Difference]: Start difference. First operand 277 states and 404 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:26,538 INFO L93 Difference]: Finished difference Result 557 states and 817 transitions. [2021-08-25 20:31:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:26,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 113 [2021-08-25 20:31:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:26,540 INFO L225 Difference]: With dead ends: 557 [2021-08-25 20:31:26,540 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:31:26,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:31:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2021-08-25 20:31:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.460144927536232) internal successors, (403), 276 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-08-25 20:31:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 403 transitions. [2021-08-25 20:31:26,547 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 403 transitions. Word has length 113 [2021-08-25 20:31:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:26,547 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 403 transitions. [2021-08-25 20:31:26,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 403 transitions. [2021-08-25 20:31:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-25 20:31:26,548 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:26,548 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:26,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-25 20:31:26,549 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:26,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1293653960, now seen corresponding path program 1 times [2021-08-25 20:31:26,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:26,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233585031] [2021-08-25 20:31:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:26,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:26,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:26,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233585031] [2021-08-25 20:31:26,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233585031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:26,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:26,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:26,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238210022] [2021-08-25 20:31:26,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:26,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:26,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:26,599 INFO L87 Difference]: Start difference. First operand 277 states and 403 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:26,804 INFO L93 Difference]: Finished difference Result 557 states and 815 transitions. [2021-08-25 20:31:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:26,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 114 [2021-08-25 20:31:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:26,806 INFO L225 Difference]: With dead ends: 557 [2021-08-25 20:31:26,806 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:31:26,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:31:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2021-08-25 20:31:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4565217391304348) internal successors, (402), 276 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 402 transitions. [2021-08-25 20:31:26,813 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 402 transitions. Word has length 114 [2021-08-25 20:31:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:26,813 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 402 transitions. [2021-08-25 20:31:26,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 402 transitions. [2021-08-25 20:31:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:31:26,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:26,814 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:26,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-25 20:31:26,814 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash -33129394, now seen corresponding path program 1 times [2021-08-25 20:31:26,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:26,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59164528] [2021-08-25 20:31:26,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:26,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:26,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:26,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59164528] [2021-08-25 20:31:26,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59164528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:26,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:26,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:26,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900188309] [2021-08-25 20:31:26,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:26,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:26,862 INFO L87 Difference]: Start difference. First operand 277 states and 402 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:27,091 INFO L93 Difference]: Finished difference Result 555 states and 811 transitions. [2021-08-25 20:31:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:27,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 115 [2021-08-25 20:31:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:27,093 INFO L225 Difference]: With dead ends: 555 [2021-08-25 20:31:27,093 INFO L226 Difference]: Without dead ends: 297 [2021-08-25 20:31:27,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-08-25 20:31:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 277. [2021-08-25 20:31:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4528985507246377) internal successors, (401), 276 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 401 transitions. [2021-08-25 20:31:27,099 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 401 transitions. Word has length 115 [2021-08-25 20:31:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:27,100 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 401 transitions. [2021-08-25 20:31:27,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 401 transitions. [2021-08-25 20:31:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:31:27,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:27,101 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:27,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-25 20:31:27,101 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:27,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:27,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1623272394, now seen corresponding path program 1 times [2021-08-25 20:31:27,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:27,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419895588] [2021-08-25 20:31:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:27,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-08-25 20:31:27,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:27,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419895588] [2021-08-25 20:31:27,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419895588] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:27,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:27,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:27,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313735751] [2021-08-25 20:31:27,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:27,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:27,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:27,151 INFO L87 Difference]: Start difference. First operand 277 states and 401 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:27,440 INFO L93 Difference]: Finished difference Result 606 states and 890 transitions. [2021-08-25 20:31:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:27,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 115 [2021-08-25 20:31:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:27,441 INFO L225 Difference]: With dead ends: 606 [2021-08-25 20:31:27,441 INFO L226 Difference]: Without dead ends: 348 [2021-08-25 20:31:27,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-08-25 20:31:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 309. [2021-08-25 20:31:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4870129870129871) internal successors, (458), 308 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 458 transitions. [2021-08-25 20:31:27,448 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 458 transitions. Word has length 115 [2021-08-25 20:31:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:27,448 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 458 transitions. [2021-08-25 20:31:27,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 458 transitions. [2021-08-25 20:31:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-25 20:31:27,449 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:27,450 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:27,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-25 20:31:27,450 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1414686661, now seen corresponding path program 1 times [2021-08-25 20:31:27,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:27,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472863721] [2021-08-25 20:31:27,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:27,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:27,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:27,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472863721] [2021-08-25 20:31:27,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472863721] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:27,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:27,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:27,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317254039] [2021-08-25 20:31:27,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:27,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:27,493 INFO L87 Difference]: Start difference. First operand 309 states and 458 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:27,796 INFO L93 Difference]: Finished difference Result 701 states and 1050 transitions. [2021-08-25 20:31:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 116 [2021-08-25 20:31:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:27,797 INFO L225 Difference]: With dead ends: 701 [2021-08-25 20:31:27,797 INFO L226 Difference]: Without dead ends: 411 [2021-08-25 20:31:27,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-08-25 20:31:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 348. [2021-08-25 20:31:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.5244956772334295) internal successors, (529), 347 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 529 transitions. [2021-08-25 20:31:27,805 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 529 transitions. Word has length 116 [2021-08-25 20:31:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:27,805 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 529 transitions. [2021-08-25 20:31:27,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 529 transitions. [2021-08-25 20:31:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:31:27,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:27,807 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:27,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-25 20:31:27,807 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash 899080889, now seen corresponding path program 1 times [2021-08-25 20:31:27,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:27,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394225257] [2021-08-25 20:31:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:27,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:27,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:27,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394225257] [2021-08-25 20:31:27,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394225257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:27,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:27,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:27,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051822786] [2021-08-25 20:31:27,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:27,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:27,850 INFO L87 Difference]: Start difference. First operand 348 states and 529 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:28,172 INFO L93 Difference]: Finished difference Result 734 states and 1113 transitions. [2021-08-25 20:31:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 117 [2021-08-25 20:31:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:28,174 INFO L225 Difference]: With dead ends: 734 [2021-08-25 20:31:28,174 INFO L226 Difference]: Without dead ends: 405 [2021-08-25 20:31:28,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-08-25 20:31:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 347. [2021-08-25 20:31:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.5260115606936415) internal successors, (528), 346 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 528 transitions. [2021-08-25 20:31:28,183 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 528 transitions. Word has length 117 [2021-08-25 20:31:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:28,183 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 528 transitions. [2021-08-25 20:31:28,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 528 transitions. [2021-08-25 20:31:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-25 20:31:28,184 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:28,185 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:28,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-25 20:31:28,185 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2005355270, now seen corresponding path program 1 times [2021-08-25 20:31:28,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:28,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920183088] [2021-08-25 20:31:28,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:28,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:28,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:28,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920183088] [2021-08-25 20:31:28,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920183088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:28,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:28,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:28,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187365473] [2021-08-25 20:31:28,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:28,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:28,233 INFO L87 Difference]: Start difference. First operand 347 states and 528 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-08-25 20:31:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:28,425 INFO L93 Difference]: Finished difference Result 701 states and 1067 transitions. [2021-08-25 20:31:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:28,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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) Word has length 117 [2021-08-25 20:31:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:28,427 INFO L225 Difference]: With dead ends: 701 [2021-08-25 20:31:28,427 INFO L226 Difference]: Without dead ends: 373 [2021-08-25 20:31:28,427 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-08-25 20:31:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2021-08-25 20:31:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.523121387283237) internal successors, (527), 346 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 527 transitions. [2021-08-25 20:31:28,435 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 527 transitions. Word has length 117 [2021-08-25 20:31:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:28,435 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 527 transitions. [2021-08-25 20:31:28,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-08-25 20:31:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 527 transitions. [2021-08-25 20:31:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-25 20:31:28,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:28,436 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:28,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-25 20:31:28,436 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash -514871743, now seen corresponding path program 1 times [2021-08-25 20:31:28,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:28,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003925109] [2021-08-25 20:31:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:28,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:28,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:28,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003925109] [2021-08-25 20:31:28,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003925109] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:28,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:28,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:28,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704505203] [2021-08-25 20:31:28,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:28,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:28,481 INFO L87 Difference]: Start difference. First operand 347 states and 527 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:28,706 INFO L93 Difference]: Finished difference Result 701 states and 1065 transitions. [2021-08-25 20:31:28,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:28,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 118 [2021-08-25 20:31:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:28,707 INFO L225 Difference]: With dead ends: 701 [2021-08-25 20:31:28,707 INFO L226 Difference]: Without dead ends: 373 [2021-08-25 20:31:28,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-08-25 20:31:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2021-08-25 20:31:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.5202312138728324) internal successors, (526), 346 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 526 transitions. [2021-08-25 20:31:28,715 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 526 transitions. Word has length 118 [2021-08-25 20:31:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:28,715 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 526 transitions. [2021-08-25 20:31:28,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 526 transitions. [2021-08-25 20:31:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 20:31:28,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:28,716 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:28,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-25 20:31:28,716 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1340700289, now seen corresponding path program 1 times [2021-08-25 20:31:28,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:28,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449664581] [2021-08-25 20:31:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:28,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:28,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:28,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449664581] [2021-08-25 20:31:28,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449664581] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:28,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:28,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:28,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503345380] [2021-08-25 20:31:28,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:28,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:28,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:28,764 INFO L87 Difference]: Start difference. First operand 347 states and 526 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:28,962 INFO L93 Difference]: Finished difference Result 701 states and 1063 transitions. [2021-08-25 20:31:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 119 [2021-08-25 20:31:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:28,963 INFO L225 Difference]: With dead ends: 701 [2021-08-25 20:31:28,963 INFO L226 Difference]: Without dead ends: 373 [2021-08-25 20:31:28,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-08-25 20:31:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2021-08-25 20:31:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.5173410404624277) internal successors, (525), 346 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 525 transitions. [2021-08-25 20:31:28,971 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 525 transitions. Word has length 119 [2021-08-25 20:31:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:28,971 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 525 transitions. [2021-08-25 20:31:28,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 525 transitions. [2021-08-25 20:31:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-25 20:31:28,972 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:28,972 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:28,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-25 20:31:28,972 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1407089244, now seen corresponding path program 1 times [2021-08-25 20:31:28,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:28,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696009189] [2021-08-25 20:31:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:28,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:29,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:29,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696009189] [2021-08-25 20:31:29,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696009189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:29,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:29,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:29,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386395356] [2021-08-25 20:31:29,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:29,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:29,017 INFO L87 Difference]: Start difference. First operand 347 states and 525 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-08-25 20:31:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:29,248 INFO L93 Difference]: Finished difference Result 691 states and 1049 transitions. [2021-08-25 20:31:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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 120 [2021-08-25 20:31:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:29,250 INFO L225 Difference]: With dead ends: 691 [2021-08-25 20:31:29,250 INFO L226 Difference]: Without dead ends: 363 [2021-08-25 20:31:29,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-08-25 20:31:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 347. [2021-08-25 20:31:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.5144508670520231) internal successors, (524), 346 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 524 transitions. [2021-08-25 20:31:29,259 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 524 transitions. Word has length 120 [2021-08-25 20:31:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:29,259 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 524 transitions. [2021-08-25 20:31:29,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-08-25 20:31:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2021-08-25 20:31:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:31:29,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:29,260 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:29,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-25 20:31:29,261 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1158786148, now seen corresponding path program 1 times [2021-08-25 20:31:29,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:29,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238472756] [2021-08-25 20:31:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:29,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:29,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:29,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238472756] [2021-08-25 20:31:29,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238472756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:29,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:29,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:29,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770079817] [2021-08-25 20:31:29,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:29,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:29,307 INFO L87 Difference]: Start difference. First operand 347 states and 524 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:29,592 INFO L93 Difference]: Finished difference Result 777 states and 1182 transitions. [2021-08-25 20:31:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:29,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 121 [2021-08-25 20:31:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:29,594 INFO L225 Difference]: With dead ends: 777 [2021-08-25 20:31:29,594 INFO L226 Difference]: Without dead ends: 449 [2021-08-25 20:31:29,594 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-08-25 20:31:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 386. [2021-08-25 20:31:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.5454545454545454) internal successors, (595), 385 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 595 transitions. [2021-08-25 20:31:29,603 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 595 transitions. Word has length 121 [2021-08-25 20:31:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:29,603 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 595 transitions. [2021-08-25 20:31:29,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 595 transitions. [2021-08-25 20:31:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:31:29,604 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:29,604 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:29,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-25 20:31:29,605 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1569164862, now seen corresponding path program 1 times [2021-08-25 20:31:29,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:29,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420108732] [2021-08-25 20:31:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:29,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:29,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:29,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420108732] [2021-08-25 20:31:29,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420108732] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:29,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:29,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:29,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035955233] [2021-08-25 20:31:29,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:29,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:29,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:29,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:29,649 INFO L87 Difference]: Start difference. First operand 386 states and 595 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-08-25 20:31:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:29,923 INFO L93 Difference]: Finished difference Result 810 states and 1245 transitions. [2021-08-25 20:31:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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) Word has length 122 [2021-08-25 20:31:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:29,925 INFO L225 Difference]: With dead ends: 810 [2021-08-25 20:31:29,925 INFO L226 Difference]: Without dead ends: 443 [2021-08-25 20:31:29,925 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-08-25 20:31:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 347. [2021-08-25 20:31:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.5144508670520231) internal successors, (524), 346 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 524 transitions. [2021-08-25 20:31:29,932 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 524 transitions. Word has length 122 [2021-08-25 20:31:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:29,932 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 524 transitions. [2021-08-25 20:31:29,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-08-25 20:31:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2021-08-25 20:31:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:31:29,933 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:29,933 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:29,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-25 20:31:29,934 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash 317587356, now seen corresponding path program 1 times [2021-08-25 20:31:29,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:29,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160281023] [2021-08-25 20:31:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:29,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:31:29,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:29,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160281023] [2021-08-25 20:31:29,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160281023] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:29,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:29,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:29,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93750306] [2021-08-25 20:31:29,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:29,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:29,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:29,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:29,978 INFO L87 Difference]: Start difference. First operand 347 states and 524 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:30,215 INFO L93 Difference]: Finished difference Result 690 states and 1046 transitions. [2021-08-25 20:31:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 123 [2021-08-25 20:31:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:30,216 INFO L225 Difference]: With dead ends: 690 [2021-08-25 20:31:30,216 INFO L226 Difference]: Without dead ends: 362 [2021-08-25 20:31:30,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-08-25 20:31:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2021-08-25 20:31:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.510028653295129) internal successors, (527), 349 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 527 transitions. [2021-08-25 20:31:30,223 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 527 transitions. Word has length 123 [2021-08-25 20:31:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:30,223 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 527 transitions. [2021-08-25 20:31:30,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 527 transitions. [2021-08-25 20:31:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:31:30,224 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:30,224 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:30,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-25 20:31:30,224 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash 870150571, now seen corresponding path program 1 times [2021-08-25 20:31:30,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:30,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354663923] [2021-08-25 20:31:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:30,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:31:30,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:30,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354663923] [2021-08-25 20:31:30,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354663923] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:30,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:30,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:30,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438623734] [2021-08-25 20:31:30,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:30,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:30,269 INFO L87 Difference]: Start difference. First operand 350 states and 527 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:30,490 INFO L93 Difference]: Finished difference Result 697 states and 1053 transitions. [2021-08-25 20:31:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:30,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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) Word has length 130 [2021-08-25 20:31:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:30,492 INFO L225 Difference]: With dead ends: 697 [2021-08-25 20:31:30,492 INFO L226 Difference]: Without dead ends: 366 [2021-08-25 20:31:30,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-25 20:31:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 350. [2021-08-25 20:31:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.507163323782235) internal successors, (526), 349 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 526 transitions. [2021-08-25 20:31:30,499 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 526 transitions. Word has length 130 [2021-08-25 20:31:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:30,499 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 526 transitions. [2021-08-25 20:31:30,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 526 transitions. [2021-08-25 20:31:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:31:30,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:30,500 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:30,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-25 20:31:30,500 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 445590493, now seen corresponding path program 1 times [2021-08-25 20:31:30,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:30,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822235539] [2021-08-25 20:31:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:30,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:31:30,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:30,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822235539] [2021-08-25 20:31:30,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822235539] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:30,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:30,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:30,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161743160] [2021-08-25 20:31:30,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:30,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:30,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:30,545 INFO L87 Difference]: Start difference. First operand 350 states and 526 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:30,768 INFO L93 Difference]: Finished difference Result 743 states and 1126 transitions. [2021-08-25 20:31:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:30,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 130 [2021-08-25 20:31:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:30,770 INFO L225 Difference]: With dead ends: 743 [2021-08-25 20:31:30,770 INFO L226 Difference]: Without dead ends: 412 [2021-08-25 20:31:30,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-08-25 20:31:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 378. [2021-08-25 20:31:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.5251989389920424) internal successors, (575), 377 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 575 transitions. [2021-08-25 20:31:30,778 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 575 transitions. Word has length 130 [2021-08-25 20:31:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:30,779 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 575 transitions. [2021-08-25 20:31:30,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 575 transitions. [2021-08-25 20:31:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-25 20:31:30,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:30,780 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:30,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-25 20:31:30,780 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash 325472144, now seen corresponding path program 1 times [2021-08-25 20:31:30,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:30,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538817006] [2021-08-25 20:31:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:30,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:31:30,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:30,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538817006] [2021-08-25 20:31:30,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538817006] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:30,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:30,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:30,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432875836] [2021-08-25 20:31:30,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:30,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:30,828 INFO L87 Difference]: Start difference. First operand 378 states and 575 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:31,021 INFO L93 Difference]: Finished difference Result 751 states and 1147 transitions. [2021-08-25 20:31:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:31,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2021-08-25 20:31:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:31,022 INFO L225 Difference]: With dead ends: 751 [2021-08-25 20:31:31,022 INFO L226 Difference]: Without dead ends: 392 [2021-08-25 20:31:31,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-08-25 20:31:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 378. [2021-08-25 20:31:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.5225464190981433) internal successors, (574), 377 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 574 transitions. [2021-08-25 20:31:31,030 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 574 transitions. Word has length 131 [2021-08-25 20:31:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:31,030 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 574 transitions. [2021-08-25 20:31:31,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 574 transitions. [2021-08-25 20:31:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-25 20:31:31,031 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:31,031 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:31,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-25 20:31:31,031 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:31,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1414750288, now seen corresponding path program 1 times [2021-08-25 20:31:31,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:31,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089091483] [2021-08-25 20:31:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:31,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:31,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:31,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089091483] [2021-08-25 20:31:31,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089091483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:31,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:31,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:31,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751414262] [2021-08-25 20:31:31,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:31,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:31,075 INFO L87 Difference]: Start difference. First operand 378 states and 574 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:31,352 INFO L93 Difference]: Finished difference Result 833 states and 1273 transitions. [2021-08-25 20:31:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:31,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 131 [2021-08-25 20:31:31,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:31,354 INFO L225 Difference]: With dead ends: 833 [2021-08-25 20:31:31,354 INFO L226 Difference]: Without dead ends: 474 [2021-08-25 20:31:31,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-25 20:31:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 390. [2021-08-25 20:31:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.519280205655527) internal successors, (591), 389 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 591 transitions. [2021-08-25 20:31:31,361 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 591 transitions. Word has length 131 [2021-08-25 20:31:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:31,362 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 591 transitions. [2021-08-25 20:31:31,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 591 transitions. [2021-08-25 20:31:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-08-25 20:31:31,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:31,363 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:31,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-25 20:31:31,363 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:31,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1643757001, now seen corresponding path program 1 times [2021-08-25 20:31:31,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:31,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263931387] [2021-08-25 20:31:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:31,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:31,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:31,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263931387] [2021-08-25 20:31:31,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263931387] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:31,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:31,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:31,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452058060] [2021-08-25 20:31:31,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:31,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:31,405 INFO L87 Difference]: Start difference. First operand 390 states and 591 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-08-25 20:31:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:31,675 INFO L93 Difference]: Finished difference Result 845 states and 1289 transitions. [2021-08-25 20:31:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:31,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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 132 [2021-08-25 20:31:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:31,676 INFO L225 Difference]: With dead ends: 845 [2021-08-25 20:31:31,677 INFO L226 Difference]: Without dead ends: 474 [2021-08-25 20:31:31,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-25 20:31:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 391. [2021-08-25 20:31:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.5179487179487179) internal successors, (592), 390 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 592 transitions. [2021-08-25 20:31:31,684 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 592 transitions. Word has length 132 [2021-08-25 20:31:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:31,684 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 592 transitions. [2021-08-25 20:31:31,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 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-08-25 20:31:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2021-08-25 20:31:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:31:31,685 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:31,685 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:31,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-25 20:31:31,685 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:31,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 704995659, now seen corresponding path program 1 times [2021-08-25 20:31:31,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:31,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275010603] [2021-08-25 20:31:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:31,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:31,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:31,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275010603] [2021-08-25 20:31:31,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275010603] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:31,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:31,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:31,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295256853] [2021-08-25 20:31:31,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:31,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:31,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:31,729 INFO L87 Difference]: Start difference. First operand 391 states and 592 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:32,008 INFO L93 Difference]: Finished difference Result 846 states and 1289 transitions. [2021-08-25 20:31:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:32,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 133 [2021-08-25 20:31:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:32,010 INFO L225 Difference]: With dead ends: 846 [2021-08-25 20:31:32,010 INFO L226 Difference]: Without dead ends: 474 [2021-08-25 20:31:32,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-25 20:31:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 392. [2021-08-25 20:31:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.5166240409207161) internal successors, (593), 391 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 593 transitions. [2021-08-25 20:31:32,017 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 593 transitions. Word has length 133 [2021-08-25 20:31:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:32,018 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 593 transitions. [2021-08-25 20:31:32,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 593 transitions. [2021-08-25 20:31:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-25 20:31:32,018 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:32,018 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:32,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-25 20:31:32,019 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:32,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1119885102, now seen corresponding path program 1 times [2021-08-25 20:31:32,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:32,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014032744] [2021-08-25 20:31:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:32,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:32,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:32,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014032744] [2021-08-25 20:31:32,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014032744] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:32,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:32,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:32,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885309794] [2021-08-25 20:31:32,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:32,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:32,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:32,069 INFO L87 Difference]: Start difference. First operand 392 states and 593 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-08-25 20:31:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:32,308 INFO L93 Difference]: Finished difference Result 837 states and 1277 transitions. [2021-08-25 20:31:32,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:32,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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) Word has length 134 [2021-08-25 20:31:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:32,309 INFO L225 Difference]: With dead ends: 837 [2021-08-25 20:31:32,309 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:31:32,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:31:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 393. [2021-08-25 20:31:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5153061224489797) internal successors, (594), 392 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 594 transitions. [2021-08-25 20:31:32,321 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 594 transitions. Word has length 134 [2021-08-25 20:31:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:32,321 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 594 transitions. [2021-08-25 20:31:32,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-08-25 20:31:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 594 transitions. [2021-08-25 20:31:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-08-25 20:31:32,322 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:32,322 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:32,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-25 20:31:32,323 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:32,323 INFO L82 PathProgramCache]: Analyzing trace with hash -595235943, now seen corresponding path program 1 times [2021-08-25 20:31:32,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:32,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869400016] [2021-08-25 20:31:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:32,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:32,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:32,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869400016] [2021-08-25 20:31:32,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869400016] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:32,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:32,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:32,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977515130] [2021-08-25 20:31:32,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:32,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:32,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:32,373 INFO L87 Difference]: Start difference. First operand 393 states and 594 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:32,678 INFO L93 Difference]: Finished difference Result 848 states and 1289 transitions. [2021-08-25 20:31:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:32,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 136 [2021-08-25 20:31:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:32,680 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:31:32,680 INFO L226 Difference]: Without dead ends: 474 [2021-08-25 20:31:32,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-25 20:31:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2021-08-25 20:31:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5127551020408163) internal successors, (593), 392 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 593 transitions. [2021-08-25 20:31:32,690 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 593 transitions. Word has length 136 [2021-08-25 20:31:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:32,690 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 593 transitions. [2021-08-25 20:31:32,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 593 transitions. [2021-08-25 20:31:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-25 20:31:32,691 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:32,691 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:32,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-25 20:31:32,691 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash 471179278, now seen corresponding path program 1 times [2021-08-25 20:31:32,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:32,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398038160] [2021-08-25 20:31:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:32,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:32,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:32,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398038160] [2021-08-25 20:31:32,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398038160] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:32,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:32,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:32,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443947383] [2021-08-25 20:31:32,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:32,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:32,735 INFO L87 Difference]: Start difference. First operand 393 states and 593 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:33,022 INFO L93 Difference]: Finished difference Result 848 states and 1287 transitions. [2021-08-25 20:31:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:33,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2021-08-25 20:31:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:33,023 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:31:33,023 INFO L226 Difference]: Without dead ends: 474 [2021-08-25 20:31:33,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-25 20:31:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2021-08-25 20:31:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.510204081632653) internal successors, (592), 392 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 592 transitions. [2021-08-25 20:31:33,031 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 592 transitions. Word has length 137 [2021-08-25 20:31:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:33,031 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 592 transitions. [2021-08-25 20:31:33,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 592 transitions. [2021-08-25 20:31:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-08-25 20:31:33,032 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:33,032 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:33,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-08-25 20:31:33,035 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:33,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1843510868, now seen corresponding path program 1 times [2021-08-25 20:31:33,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:33,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55005856] [2021-08-25 20:31:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:33,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:33,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:33,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55005856] [2021-08-25 20:31:33,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55005856] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:33,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:33,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:33,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82341357] [2021-08-25 20:31:33,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:33,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:33,076 INFO L87 Difference]: Start difference. First operand 393 states and 592 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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-08-25 20:31:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:33,415 INFO L93 Difference]: Finished difference Result 848 states and 1285 transitions. [2021-08-25 20:31:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 138 [2021-08-25 20:31:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:33,417 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:31:33,417 INFO L226 Difference]: Without dead ends: 474 [2021-08-25 20:31:33,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-25 20:31:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2021-08-25 20:31:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5076530612244898) internal successors, (591), 392 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 591 transitions. [2021-08-25 20:31:33,431 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 591 transitions. Word has length 138 [2021-08-25 20:31:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:33,431 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 591 transitions. [2021-08-25 20:31:33,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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-08-25 20:31:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 591 transitions. [2021-08-25 20:31:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-25 20:31:33,433 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:33,433 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:33,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-08-25 20:31:33,433 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:33,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:33,433 INFO L82 PathProgramCache]: Analyzing trace with hash -185651991, now seen corresponding path program 1 times [2021-08-25 20:31:33,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:33,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116830191] [2021-08-25 20:31:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:33,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:33,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:33,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116830191] [2021-08-25 20:31:33,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116830191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:33,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:33,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:33,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566295273] [2021-08-25 20:31:33,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:33,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:33,479 INFO L87 Difference]: Start difference. First operand 393 states and 591 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:33,809 INFO L93 Difference]: Finished difference Result 838 states and 1271 transitions. [2021-08-25 20:31:33,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:33,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 139 [2021-08-25 20:31:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:33,811 INFO L225 Difference]: With dead ends: 838 [2021-08-25 20:31:33,811 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:31:33,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:31:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 378. [2021-08-25 20:31:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.5119363395225465) internal successors, (570), 377 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 570 transitions. [2021-08-25 20:31:33,823 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 570 transitions. Word has length 139 [2021-08-25 20:31:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:33,824 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 570 transitions. [2021-08-25 20:31:33,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 570 transitions. [2021-08-25 20:31:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-25 20:31:33,825 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:33,825 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:33,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-08-25 20:31:33,825 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash -212711369, now seen corresponding path program 1 times [2021-08-25 20:31:33,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:33,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862897269] [2021-08-25 20:31:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:33,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:33,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:33,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862897269] [2021-08-25 20:31:33,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862897269] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:33,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:33,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:33,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076093607] [2021-08-25 20:31:33,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:33,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:33,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:33,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:33,868 INFO L87 Difference]: Start difference. First operand 378 states and 570 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:34,114 INFO L93 Difference]: Finished difference Result 823 states and 1249 transitions. [2021-08-25 20:31:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 141 [2021-08-25 20:31:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:34,116 INFO L225 Difference]: With dead ends: 823 [2021-08-25 20:31:34,116 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:31:34,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:31:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 406. [2021-08-25 20:31:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.5185185185185186) internal successors, (615), 405 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 615 transitions. [2021-08-25 20:31:34,127 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 615 transitions. Word has length 141 [2021-08-25 20:31:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:34,127 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 615 transitions. [2021-08-25 20:31:34,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 615 transitions. [2021-08-25 20:31:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-08-25 20:31:34,128 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:34,128 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:34,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-08-25 20:31:34,128 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1817448354, now seen corresponding path program 1 times [2021-08-25 20:31:34,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:34,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483136070] [2021-08-25 20:31:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:34,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:34,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:34,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483136070] [2021-08-25 20:31:34,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483136070] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:34,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:34,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:34,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783255519] [2021-08-25 20:31:34,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:34,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:34,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:34,172 INFO L87 Difference]: Start difference. First operand 406 states and 615 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:34,457 INFO L93 Difference]: Finished difference Result 843 states and 1280 transitions. [2021-08-25 20:31:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 142 [2021-08-25 20:31:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:34,459 INFO L225 Difference]: With dead ends: 843 [2021-08-25 20:31:34,459 INFO L226 Difference]: Without dead ends: 456 [2021-08-25 20:31:34,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-08-25 20:31:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 407. [2021-08-25 20:31:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5172413793103448) internal successors, (616), 406 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2021-08-25 20:31:34,472 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 142 [2021-08-25 20:31:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:34,472 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2021-08-25 20:31:34,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2021-08-25 20:31:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-25 20:31:34,473 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:34,473 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:34,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-08-25 20:31:34,473 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash -29899615, now seen corresponding path program 1 times [2021-08-25 20:31:34,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:34,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409167728] [2021-08-25 20:31:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:34,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:31:34,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:34,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409167728] [2021-08-25 20:31:34,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409167728] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:34,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:34,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:34,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522022444] [2021-08-25 20:31:34,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:34,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:34,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:34,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:34,517 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:34,765 INFO L93 Difference]: Finished difference Result 844 states and 1280 transitions. [2021-08-25 20:31:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:34,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-08-25 20:31:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:34,767 INFO L225 Difference]: With dead ends: 844 [2021-08-25 20:31:34,767 INFO L226 Difference]: Without dead ends: 456 [2021-08-25 20:31:34,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-08-25 20:31:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 407. [2021-08-25 20:31:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5147783251231528) internal successors, (615), 406 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 615 transitions. [2021-08-25 20:31:34,776 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 615 transitions. Word has length 144 [2021-08-25 20:31:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:34,777 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 615 transitions. [2021-08-25 20:31:34,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 615 transitions. [2021-08-25 20:31:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-08-25 20:31:34,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:34,777 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:34,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-08-25 20:31:34,778 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1806279846, now seen corresponding path program 1 times [2021-08-25 20:31:34,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:34,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71708879] [2021-08-25 20:31:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:34,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:31:34,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:34,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71708879] [2021-08-25 20:31:34,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71708879] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:34,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:34,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:34,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900880797] [2021-08-25 20:31:34,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:34,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:34,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:34,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:34,821 INFO L87 Difference]: Start difference. First operand 407 states and 615 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:35,077 INFO L93 Difference]: Finished difference Result 842 states and 1276 transitions. [2021-08-25 20:31:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:35,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 145 [2021-08-25 20:31:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:35,078 INFO L225 Difference]: With dead ends: 842 [2021-08-25 20:31:35,078 INFO L226 Difference]: Without dead ends: 454 [2021-08-25 20:31:35,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-25 20:31:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2021-08-25 20:31:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2021-08-25 20:31:35,090 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 145 [2021-08-25 20:31:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:35,090 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2021-08-25 20:31:35,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2021-08-25 20:31:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-08-25 20:31:35,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:35,091 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:35,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-08-25 20:31:35,091 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -108566865, now seen corresponding path program 1 times [2021-08-25 20:31:35,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:35,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915748634] [2021-08-25 20:31:35,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:35,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:35,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:35,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915748634] [2021-08-25 20:31:35,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915748634] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:35,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:35,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:35,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743656101] [2021-08-25 20:31:35,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:35,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:35,133 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:35,366 INFO L93 Difference]: Finished difference Result 839 states and 1270 transitions. [2021-08-25 20:31:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:35,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2021-08-25 20:31:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:35,368 INFO L225 Difference]: With dead ends: 839 [2021-08-25 20:31:35,368 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:31:35,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:31:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2021-08-25 20:31:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.5134474327628362) internal successors, (619), 409 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2021-08-25 20:31:35,379 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 145 [2021-08-25 20:31:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:35,380 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2021-08-25 20:31:35,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2021-08-25 20:31:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-08-25 20:31:35,388 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:35,389 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:35,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-08-25 20:31:35,389 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1574770376, now seen corresponding path program 1 times [2021-08-25 20:31:35,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:35,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860676639] [2021-08-25 20:31:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:35,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:31:35,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:35,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860676639] [2021-08-25 20:31:35,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860676639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:35,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:35,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:35,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464628898] [2021-08-25 20:31:35,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:35,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:35,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:35,441 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:35,723 INFO L93 Difference]: Finished difference Result 835 states and 1262 transitions. [2021-08-25 20:31:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:35,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 145 [2021-08-25 20:31:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:35,725 INFO L225 Difference]: With dead ends: 835 [2021-08-25 20:31:35,725 INFO L226 Difference]: Without dead ends: 444 [2021-08-25 20:31:35,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-08-25 20:31:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2021-08-25 20:31:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.511002444987775) internal successors, (618), 409 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 618 transitions. [2021-08-25 20:31:35,742 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 618 transitions. Word has length 145 [2021-08-25 20:31:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:35,743 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 618 transitions. [2021-08-25 20:31:35,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 618 transitions. [2021-08-25 20:31:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-08-25 20:31:35,744 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:35,744 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:35,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-08-25 20:31:35,745 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:35,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1377203136, now seen corresponding path program 1 times [2021-08-25 20:31:35,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:35,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585149223] [2021-08-25 20:31:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:35,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:35,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:35,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585149223] [2021-08-25 20:31:35,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585149223] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:35,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:35,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:35,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112915231] [2021-08-25 20:31:35,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:35,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:35,797 INFO L87 Difference]: Start difference. First operand 410 states and 618 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:36,050 INFO L93 Difference]: Finished difference Result 855 states and 1291 transitions. [2021-08-25 20:31:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 146 [2021-08-25 20:31:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:36,052 INFO L225 Difference]: With dead ends: 855 [2021-08-25 20:31:36,052 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:31:36,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:31:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 410. [2021-08-25 20:31:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.5085574572127138) internal successors, (617), 409 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2021-08-25 20:31:36,064 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 146 [2021-08-25 20:31:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:36,064 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2021-08-25 20:31:36,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2021-08-25 20:31:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-08-25 20:31:36,065 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:36,065 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:36,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-08-25 20:31:36,065 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:36,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:36,065 INFO L82 PathProgramCache]: Analyzing trace with hash 170382927, now seen corresponding path program 1 times [2021-08-25 20:31:36,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:36,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813393753] [2021-08-25 20:31:36,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:36,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:31:36,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:36,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813393753] [2021-08-25 20:31:36,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813393753] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:36,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:36,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:36,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092539686] [2021-08-25 20:31:36,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:36,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:36,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:36,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:36,114 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:36,409 INFO L93 Difference]: Finished difference Result 835 states and 1258 transitions. [2021-08-25 20:31:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 146 [2021-08-25 20:31:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:36,411 INFO L225 Difference]: With dead ends: 835 [2021-08-25 20:31:36,411 INFO L226 Difference]: Without dead ends: 444 [2021-08-25 20:31:36,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-08-25 20:31:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2021-08-25 20:31:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.5061124694376529) internal successors, (616), 409 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 616 transitions. [2021-08-25 20:31:36,425 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 616 transitions. Word has length 146 [2021-08-25 20:31:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:36,425 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 616 transitions. [2021-08-25 20:31:36,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 616 transitions. [2021-08-25 20:31:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:31:36,426 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:36,426 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:36,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-08-25 20:31:36,426 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash 738012533, now seen corresponding path program 1 times [2021-08-25 20:31:36,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:36,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691170256] [2021-08-25 20:31:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:36,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:36,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:36,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691170256] [2021-08-25 20:31:36,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691170256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:36,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:36,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:36,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893917966] [2021-08-25 20:31:36,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:36,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:36,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:36,470 INFO L87 Difference]: Start difference. First operand 410 states and 616 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:36,736 INFO L93 Difference]: Finished difference Result 847 states and 1274 transitions. [2021-08-25 20:31:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 147 [2021-08-25 20:31:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:36,746 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:31:36,746 INFO L226 Difference]: Without dead ends: 456 [2021-08-25 20:31:36,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-08-25 20:31:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 410. [2021-08-25 20:31:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.5036674816625917) internal successors, (615), 409 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2021-08-25 20:31:36,760 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 147 [2021-08-25 20:31:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:36,760 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2021-08-25 20:31:36,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2021-08-25 20:31:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:31:36,761 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:36,762 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:36,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-08-25 20:31:36,762 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:36,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1344308336, now seen corresponding path program 1 times [2021-08-25 20:31:36,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:36,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925505861] [2021-08-25 20:31:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:36,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:36,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:36,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925505861] [2021-08-25 20:31:36,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925505861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:36,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:36,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:36,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721125037] [2021-08-25 20:31:36,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:36,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:36,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:36,816 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:37,055 INFO L93 Difference]: Finished difference Result 842 states and 1266 transitions. [2021-08-25 20:31:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:37,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 147 [2021-08-25 20:31:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:37,057 INFO L225 Difference]: With dead ends: 842 [2021-08-25 20:31:37,057 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:31:37,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:31:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 411. [2021-08-25 20:31:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.502439024390244) internal successors, (616), 410 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2021-08-25 20:31:37,071 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 147 [2021-08-25 20:31:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:37,072 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2021-08-25 20:31:37,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2021-08-25 20:31:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:31:37,073 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:37,073 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:37,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-08-25 20:31:37,074 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1108758579, now seen corresponding path program 1 times [2021-08-25 20:31:37,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:37,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451589280] [2021-08-25 20:31:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:37,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:31:37,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451589280] [2021-08-25 20:31:37,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451589280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846153468] [2021-08-25 20:31:37,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,123 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:37,365 INFO L93 Difference]: Finished difference Result 837 states and 1256 transitions. [2021-08-25 20:31:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:37,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 147 [2021-08-25 20:31:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:37,366 INFO L225 Difference]: With dead ends: 837 [2021-08-25 20:31:37,366 INFO L226 Difference]: Without dead ends: 445 [2021-08-25 20:31:37,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-08-25 20:31:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 411. [2021-08-25 20:31:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.5) internal successors, (615), 410 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 615 transitions. [2021-08-25 20:31:37,379 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 615 transitions. Word has length 147 [2021-08-25 20:31:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:37,379 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 615 transitions. [2021-08-25 20:31:37,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 615 transitions. [2021-08-25 20:31:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:31:37,380 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:37,381 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:37,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-08-25 20:31:37,381 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash -506259172, now seen corresponding path program 1 times [2021-08-25 20:31:37,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:37,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652577973] [2021-08-25 20:31:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:37,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:37,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652577973] [2021-08-25 20:31:37,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652577973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329550332] [2021-08-25 20:31:37,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,424 INFO L87 Difference]: Start difference. First operand 411 states and 615 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:37,699 INFO L93 Difference]: Finished difference Result 839 states and 1259 transitions. [2021-08-25 20:31:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 148 [2021-08-25 20:31:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:37,701 INFO L225 Difference]: With dead ends: 839 [2021-08-25 20:31:37,701 INFO L226 Difference]: Without dead ends: 447 [2021-08-25 20:31:37,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-08-25 20:31:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 412. [2021-08-25 20:31:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4987834549878345) internal successors, (616), 411 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 616 transitions. [2021-08-25 20:31:37,716 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 616 transitions. Word has length 148 [2021-08-25 20:31:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:37,716 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 616 transitions. [2021-08-25 20:31:37,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 616 transitions. [2021-08-25 20:31:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:31:37,718 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:37,718 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:37,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-08-25 20:31:37,719 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1511302130, now seen corresponding path program 1 times [2021-08-25 20:31:37,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:37,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364055180] [2021-08-25 20:31:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:37,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:37,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:37,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364055180] [2021-08-25 20:31:37,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364055180] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:37,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:37,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:37,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570979718] [2021-08-25 20:31:37,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:37,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:37,763 INFO L87 Difference]: Start difference. First operand 412 states and 616 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:38,038 INFO L93 Difference]: Finished difference Result 840 states and 1259 transitions. [2021-08-25 20:31:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 148 [2021-08-25 20:31:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:38,039 INFO L225 Difference]: With dead ends: 840 [2021-08-25 20:31:38,040 INFO L226 Difference]: Without dead ends: 447 [2021-08-25 20:31:38,040 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-08-25 20:31:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 413. [2021-08-25 20:31:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4975728155339805) internal successors, (617), 412 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 617 transitions. [2021-08-25 20:31:38,057 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 617 transitions. Word has length 148 [2021-08-25 20:31:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:38,058 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 617 transitions. [2021-08-25 20:31:38,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 617 transitions. [2021-08-25 20:31:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 20:31:38,059 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:38,059 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:38,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-08-25 20:31:38,059 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1488136470, now seen corresponding path program 1 times [2021-08-25 20:31:38,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:38,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005922220] [2021-08-25 20:31:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:38,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:31:38,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:38,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005922220] [2021-08-25 20:31:38,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005922220] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:38,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:38,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:38,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868672428] [2021-08-25 20:31:38,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:38,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:38,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:38,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:38,110 INFO L87 Difference]: Start difference. First operand 413 states and 617 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:38,376 INFO L93 Difference]: Finished difference Result 831 states and 1246 transitions. [2021-08-25 20:31:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 148 [2021-08-25 20:31:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:38,377 INFO L225 Difference]: With dead ends: 831 [2021-08-25 20:31:38,377 INFO L226 Difference]: Without dead ends: 437 [2021-08-25 20:31:38,377 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-08-25 20:31:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 413. [2021-08-25 20:31:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4951456310679612) internal successors, (616), 412 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 616 transitions. [2021-08-25 20:31:38,395 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 616 transitions. Word has length 148 [2021-08-25 20:31:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:38,395 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 616 transitions. [2021-08-25 20:31:38,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 616 transitions. [2021-08-25 20:31:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-08-25 20:31:38,400 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:38,400 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:38,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-08-25 20:31:38,401 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:38,401 INFO L82 PathProgramCache]: Analyzing trace with hash -953280520, now seen corresponding path program 1 times [2021-08-25 20:31:38,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:38,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434460770] [2021-08-25 20:31:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:38,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:31:38,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:38,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434460770] [2021-08-25 20:31:38,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434460770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:38,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:38,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:38,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142849332] [2021-08-25 20:31:38,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:38,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:38,446 INFO L87 Difference]: Start difference. First operand 413 states and 616 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:38,769 INFO L93 Difference]: Finished difference Result 850 states and 1268 transitions. [2021-08-25 20:31:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:38,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 149 [2021-08-25 20:31:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:38,771 INFO L225 Difference]: With dead ends: 850 [2021-08-25 20:31:38,771 INFO L226 Difference]: Without dead ends: 456 [2021-08-25 20:31:38,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-08-25 20:31:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 413. [2021-08-25 20:31:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4927184466019416) internal successors, (615), 412 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 615 transitions. [2021-08-25 20:31:38,787 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 615 transitions. Word has length 149 [2021-08-25 20:31:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:38,787 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 615 transitions. [2021-08-25 20:31:38,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 615 transitions. [2021-08-25 20:31:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-08-25 20:31:38,788 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:38,788 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:38,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-08-25 20:31:38,789 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1119754174, now seen corresponding path program 1 times [2021-08-25 20:31:38,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:38,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577227261] [2021-08-25 20:31:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:38,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:38,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:38,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577227261] [2021-08-25 20:31:38,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577227261] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:38,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:38,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:38,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858141802] [2021-08-25 20:31:38,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:38,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:38,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:38,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:38,833 INFO L87 Difference]: Start difference. First operand 413 states and 615 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:39,092 INFO L93 Difference]: Finished difference Result 839 states and 1253 transitions. [2021-08-25 20:31:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2021-08-25 20:31:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:39,093 INFO L225 Difference]: With dead ends: 839 [2021-08-25 20:31:39,093 INFO L226 Difference]: Without dead ends: 445 [2021-08-25 20:31:39,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-08-25 20:31:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 414. [2021-08-25 20:31:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4915254237288136) internal successors, (616), 413 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 616 transitions. [2021-08-25 20:31:39,107 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 616 transitions. Word has length 149 [2021-08-25 20:31:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:39,107 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 616 transitions. [2021-08-25 20:31:39,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 616 transitions. [2021-08-25 20:31:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-25 20:31:39,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:39,109 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:39,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-08-25 20:31:39,109 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash -366316829, now seen corresponding path program 1 times [2021-08-25 20:31:39,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:39,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879367006] [2021-08-25 20:31:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:39,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:31:39,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:39,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879367006] [2021-08-25 20:31:39,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879367006] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:39,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:39,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:39,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830395712] [2021-08-25 20:31:39,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:39,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:39,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:39,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:39,152 INFO L87 Difference]: Start difference. First operand 414 states and 616 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:39,404 INFO L93 Difference]: Finished difference Result 849 states and 1264 transitions. [2021-08-25 20:31:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 150 [2021-08-25 20:31:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:39,405 INFO L225 Difference]: With dead ends: 849 [2021-08-25 20:31:39,405 INFO L226 Difference]: Without dead ends: 454 [2021-08-25 20:31:39,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-25 20:31:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 414. [2021-08-25 20:31:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4891041162227603) internal successors, (615), 413 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 615 transitions. [2021-08-25 20:31:39,417 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 615 transitions. Word has length 150 [2021-08-25 20:31:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:39,417 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 615 transitions. [2021-08-25 20:31:39,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 615 transitions. [2021-08-25 20:31:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-25 20:31:39,418 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:39,418 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:39,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-08-25 20:31:39,418 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1331396152, now seen corresponding path program 1 times [2021-08-25 20:31:39,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:39,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358686194] [2021-08-25 20:31:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:39,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:39,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:39,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358686194] [2021-08-25 20:31:39,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358686194] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:39,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:39,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:39,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260490783] [2021-08-25 20:31:39,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:39,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:39,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:39,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:39,460 INFO L87 Difference]: Start difference. First operand 414 states and 615 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 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-08-25 20:31:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:39,737 INFO L93 Difference]: Finished difference Result 846 states and 1258 transitions. [2021-08-25 20:31:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 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) Word has length 150 [2021-08-25 20:31:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:39,738 INFO L225 Difference]: With dead ends: 846 [2021-08-25 20:31:39,739 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:31:39,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:31:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 414. [2021-08-25 20:31:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.486682808716707) internal successors, (614), 413 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 614 transitions. [2021-08-25 20:31:39,751 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 614 transitions. Word has length 150 [2021-08-25 20:31:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:39,751 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 614 transitions. [2021-08-25 20:31:39,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 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-08-25 20:31:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 614 transitions. [2021-08-25 20:31:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-25 20:31:39,752 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:39,752 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:39,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-08-25 20:31:39,753 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:39,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1822138889, now seen corresponding path program 1 times [2021-08-25 20:31:39,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:39,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860306508] [2021-08-25 20:31:39,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:39,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:39,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:39,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860306508] [2021-08-25 20:31:39,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860306508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:39,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:39,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:39,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801517035] [2021-08-25 20:31:39,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:39,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:39,796 INFO L87 Difference]: Start difference. First operand 414 states and 614 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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-08-25 20:31:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:40,036 INFO L93 Difference]: Finished difference Result 840 states and 1249 transitions. [2021-08-25 20:31:40,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:40,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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 150 [2021-08-25 20:31:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:40,037 INFO L225 Difference]: With dead ends: 840 [2021-08-25 20:31:40,037 INFO L226 Difference]: Without dead ends: 445 [2021-08-25 20:31:40,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-08-25 20:31:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 415. [2021-08-25 20:31:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.4855072463768115) internal successors, (615), 414 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 615 transitions. [2021-08-25 20:31:40,053 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 615 transitions. Word has length 150 [2021-08-25 20:31:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:40,053 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 615 transitions. [2021-08-25 20:31:40,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 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-08-25 20:31:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 615 transitions. [2021-08-25 20:31:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-08-25 20:31:40,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:40,054 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:40,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-08-25 20:31:40,054 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2067168413, now seen corresponding path program 1 times [2021-08-25 20:31:40,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:40,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23381264] [2021-08-25 20:31:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:40,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:40,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:40,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23381264] [2021-08-25 20:31:40,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23381264] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:40,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:40,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:40,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119137810] [2021-08-25 20:31:40,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:40,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:40,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:40,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:40,096 INFO L87 Difference]: Start difference. First operand 415 states and 615 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:40,356 INFO L93 Difference]: Finished difference Result 839 states and 1247 transitions. [2021-08-25 20:31:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 151 [2021-08-25 20:31:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:40,357 INFO L225 Difference]: With dead ends: 839 [2021-08-25 20:31:40,358 INFO L226 Difference]: Without dead ends: 443 [2021-08-25 20:31:40,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-08-25 20:31:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 416. [2021-08-25 20:31:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.4843373493975904) internal successors, (616), 415 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 616 transitions. [2021-08-25 20:31:40,374 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 616 transitions. Word has length 151 [2021-08-25 20:31:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:40,374 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 616 transitions. [2021-08-25 20:31:40,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 616 transitions. [2021-08-25 20:31:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-08-25 20:31:40,376 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:40,376 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:40,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-08-25 20:31:40,376 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2125668935, now seen corresponding path program 1 times [2021-08-25 20:31:40,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:40,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14091322] [2021-08-25 20:31:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:40,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:40,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:40,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14091322] [2021-08-25 20:31:40,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14091322] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:40,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:40,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:40,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059231685] [2021-08-25 20:31:40,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:40,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:40,418 INFO L87 Difference]: Start difference. First operand 416 states and 616 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:40,674 INFO L93 Difference]: Finished difference Result 848 states and 1256 transitions. [2021-08-25 20:31:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 152 [2021-08-25 20:31:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:40,676 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:31:40,676 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:31:40,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:31:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 416. [2021-08-25 20:31:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.4819277108433735) internal successors, (615), 415 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 615 transitions. [2021-08-25 20:31:40,691 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 615 transitions. Word has length 152 [2021-08-25 20:31:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:40,691 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 615 transitions. [2021-08-25 20:31:40,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 615 transitions. [2021-08-25 20:31:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-25 20:31:40,692 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:40,692 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:40,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-08-25 20:31:40,692 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash -701372173, now seen corresponding path program 1 times [2021-08-25 20:31:40,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:40,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519264973] [2021-08-25 20:31:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:40,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:40,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:40,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519264973] [2021-08-25 20:31:40,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519264973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:40,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:40,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:40,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16541125] [2021-08-25 20:31:40,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:40,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:40,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:40,738 INFO L87 Difference]: Start difference. First operand 416 states and 615 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:40,968 INFO L93 Difference]: Finished difference Result 844 states and 1249 transitions. [2021-08-25 20:31:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 153 [2021-08-25 20:31:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:40,969 INFO L225 Difference]: With dead ends: 844 [2021-08-25 20:31:40,969 INFO L226 Difference]: Without dead ends: 447 [2021-08-25 20:31:40,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-08-25 20:31:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 416. [2021-08-25 20:31:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.4795180722891565) internal successors, (614), 415 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 614 transitions. [2021-08-25 20:31:40,985 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 614 transitions. Word has length 153 [2021-08-25 20:31:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:40,985 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 614 transitions. [2021-08-25 20:31:40,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 614 transitions. [2021-08-25 20:31:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-25 20:31:40,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:40,986 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:40,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-08-25 20:31:40,987 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:40,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:40,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1706415131, now seen corresponding path program 1 times [2021-08-25 20:31:40,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:40,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845336258] [2021-08-25 20:31:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:40,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:41,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845336258] [2021-08-25 20:31:41,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845336258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911475856] [2021-08-25 20:31:41,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,030 INFO L87 Difference]: Start difference. First operand 416 states and 614 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:41,256 INFO L93 Difference]: Finished difference Result 844 states and 1247 transitions. [2021-08-25 20:31:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 153 [2021-08-25 20:31:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:41,257 INFO L225 Difference]: With dead ends: 844 [2021-08-25 20:31:41,257 INFO L226 Difference]: Without dead ends: 447 [2021-08-25 20:31:41,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-08-25 20:31:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 416. [2021-08-25 20:31:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.4771084337349398) internal successors, (613), 415 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 613 transitions. [2021-08-25 20:31:41,272 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 613 transitions. Word has length 153 [2021-08-25 20:31:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:41,273 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 613 transitions. [2021-08-25 20:31:41,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 613 transitions. [2021-08-25 20:31:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-08-25 20:31:41,274 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:41,274 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:41,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-08-25 20:31:41,274 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1421677387, now seen corresponding path program 1 times [2021-08-25 20:31:41,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:41,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338824894] [2021-08-25 20:31:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:41,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:41,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338824894] [2021-08-25 20:31:41,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338824894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076890559] [2021-08-25 20:31:41,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,317 INFO L87 Difference]: Start difference. First operand 416 states and 613 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:41,553 INFO L93 Difference]: Finished difference Result 842 states and 1243 transitions. [2021-08-25 20:31:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:41,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 154 [2021-08-25 20:31:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:41,555 INFO L225 Difference]: With dead ends: 842 [2021-08-25 20:31:41,555 INFO L226 Difference]: Without dead ends: 445 [2021-08-25 20:31:41,555 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-08-25 20:31:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 416. [2021-08-25 20:31:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.4746987951807229) internal successors, (612), 415 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 612 transitions. [2021-08-25 20:31:41,573 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 612 transitions. Word has length 154 [2021-08-25 20:31:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:41,573 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 612 transitions. [2021-08-25 20:31:41,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 612 transitions. [2021-08-25 20:31:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:31:41,574 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:41,574 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-08-25 20:31:41,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-08-25 20:31:41,575 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:41,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash -997861344, now seen corresponding path program 1 times [2021-08-25 20:31:41,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:41,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278516525] [2021-08-25 20:31:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:41,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:41,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278516525] [2021-08-25 20:31:41,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278516525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095881546] [2021-08-25 20:31:41,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,622 INFO L87 Difference]: Start difference. First operand 416 states and 612 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:41,861 INFO L93 Difference]: Finished difference Result 842 states and 1241 transitions. [2021-08-25 20:31:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2021-08-25 20:31:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:41,862 INFO L225 Difference]: With dead ends: 842 [2021-08-25 20:31:41,862 INFO L226 Difference]: Without dead ends: 445 [2021-08-25 20:31:41,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-08-25 20:31:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 416. [2021-08-25 20:31:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.472289156626506) internal successors, (611), 415 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 611 transitions. [2021-08-25 20:31:41,874 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 611 transitions. Word has length 155 [2021-08-25 20:31:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:41,874 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 611 transitions. [2021-08-25 20:31:41,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 611 transitions. [2021-08-25 20:31:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:31:41,875 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:41,875 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:41,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-08-25 20:31:41,875 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash -124137697, now seen corresponding path program 1 times [2021-08-25 20:31:41,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:41,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756903575] [2021-08-25 20:31:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:41,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:31:41,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:41,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756903575] [2021-08-25 20:31:41,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756903575] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:41,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:41,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:41,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612064453] [2021-08-25 20:31:41,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:41,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:41,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:41,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:41,915 INFO L87 Difference]: Start difference. First operand 416 states and 611 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-08-25 20:31:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:42,149 INFO L93 Difference]: Finished difference Result 879 states and 1302 transitions. [2021-08-25 20:31:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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) Word has length 155 [2021-08-25 20:31:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:42,150 INFO L225 Difference]: With dead ends: 879 [2021-08-25 20:31:42,150 INFO L226 Difference]: Without dead ends: 482 [2021-08-25 20:31:42,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-25 20:31:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 446. [2021-08-25 20:31:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4921348314606742) internal successors, (664), 445 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 664 transitions. [2021-08-25 20:31:42,164 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 664 transitions. Word has length 155 [2021-08-25 20:31:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:42,164 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 664 transitions. [2021-08-25 20:31:42,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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-08-25 20:31:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 664 transitions. [2021-08-25 20:31:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:31:42,165 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:42,165 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:31:42,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-08-25 20:31:42,165 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 546507110, now seen corresponding path program 1 times [2021-08-25 20:31:42,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:42,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120992195] [2021-08-25 20:31:42,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:42,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:42,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:42,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120992195] [2021-08-25 20:31:42,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120992195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:42,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:42,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:42,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720896963] [2021-08-25 20:31:42,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:42,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:42,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:42,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:42,215 INFO L87 Difference]: Start difference. First operand 446 states and 664 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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-08-25 20:31:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:42,441 INFO L93 Difference]: Finished difference Result 900 states and 1343 transitions. [2021-08-25 20:31:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:42,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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) Word has length 156 [2021-08-25 20:31:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:42,442 INFO L225 Difference]: With dead ends: 900 [2021-08-25 20:31:42,442 INFO L226 Difference]: Without dead ends: 473 [2021-08-25 20:31:42,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-08-25 20:31:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 408. [2021-08-25 20:31:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4938574938574938) internal successors, (608), 407 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 608 transitions. [2021-08-25 20:31:42,456 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 608 transitions. Word has length 156 [2021-08-25 20:31:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:42,456 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 608 transitions. [2021-08-25 20:31:42,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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-08-25 20:31:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 608 transitions. [2021-08-25 20:31:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-08-25 20:31:42,457 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:42,457 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:42,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-08-25 20:31:42,457 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1786539332, now seen corresponding path program 1 times [2021-08-25 20:31:42,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:42,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070420098] [2021-08-25 20:31:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:42,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:31:42,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:42,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070420098] [2021-08-25 20:31:42,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070420098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:42,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:42,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:42,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32369559] [2021-08-25 20:31:42,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:42,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:42,500 INFO L87 Difference]: Start difference. First operand 408 states and 608 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:42,730 INFO L93 Difference]: Finished difference Result 862 states and 1286 transitions. [2021-08-25 20:31:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:42,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 158 [2021-08-25 20:31:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:42,731 INFO L225 Difference]: With dead ends: 862 [2021-08-25 20:31:42,731 INFO L226 Difference]: Without dead ends: 473 [2021-08-25 20:31:42,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-08-25 20:31:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 438. [2021-08-25 20:31:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.494279176201373) internal successors, (653), 437 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 653 transitions. [2021-08-25 20:31:42,745 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 653 transitions. Word has length 158 [2021-08-25 20:31:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:42,746 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 653 transitions. [2021-08-25 20:31:42,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 653 transitions. [2021-08-25 20:31:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-08-25 20:31:42,746 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:42,746 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:42,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-08-25 20:31:42,747 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1558443193, now seen corresponding path program 1 times [2021-08-25 20:31:42,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:42,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951898835] [2021-08-25 20:31:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:42,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-08-25 20:31:42,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:42,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951898835] [2021-08-25 20:31:42,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951898835] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:42,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:42,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:42,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516666659] [2021-08-25 20:31:42,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:42,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:42,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:42,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:42,789 INFO L87 Difference]: Start difference. First operand 438 states and 653 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-08-25 20:31:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,007 INFO L93 Difference]: Finished difference Result 881 states and 1318 transitions. [2021-08-25 20:31:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:43,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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 158 [2021-08-25 20:31:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,009 INFO L225 Difference]: With dead ends: 881 [2021-08-25 20:31:43,009 INFO L226 Difference]: Without dead ends: 462 [2021-08-25 20:31:43,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-08-25 20:31:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 438. [2021-08-25 20:31:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.4919908466819223) internal successors, (652), 437 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 652 transitions. [2021-08-25 20:31:43,022 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 652 transitions. Word has length 158 [2021-08-25 20:31:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,022 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 652 transitions. [2021-08-25 20:31:43,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-08-25 20:31:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 652 transitions. [2021-08-25 20:31:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:31:43,023 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,023 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:43,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-08-25 20:31:43,023 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash -359235427, now seen corresponding path program 1 times [2021-08-25 20:31:43,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321493632] [2021-08-25 20:31:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-25 20:31:43,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321493632] [2021-08-25 20:31:43,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321493632] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:43,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768219440] [2021-08-25 20:31:43,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:43,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:43,063 INFO L87 Difference]: Start difference. First operand 438 states and 652 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,281 INFO L93 Difference]: Finished difference Result 890 states and 1326 transitions. [2021-08-25 20:31:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:43,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 159 [2021-08-25 20:31:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,282 INFO L225 Difference]: With dead ends: 890 [2021-08-25 20:31:43,282 INFO L226 Difference]: Without dead ends: 471 [2021-08-25 20:31:43,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-08-25 20:31:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 439. [2021-08-25 20:31:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.4908675799086757) internal successors, (653), 438 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 653 transitions. [2021-08-25 20:31:43,296 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 653 transitions. Word has length 159 [2021-08-25 20:31:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,296 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 653 transitions. [2021-08-25 20:31:43,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 653 transitions. [2021-08-25 20:31:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:31:43,297 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,297 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:43,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-08-25 20:31:43,297 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash 557596907, now seen corresponding path program 1 times [2021-08-25 20:31:43,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142116327] [2021-08-25 20:31:43,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-08-25 20:31:43,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142116327] [2021-08-25 20:31:43,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142116327] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:43,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259815222] [2021-08-25 20:31:43,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:43,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:43,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:43,333 INFO L87 Difference]: Start difference. First operand 439 states and 653 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,395 INFO L93 Difference]: Finished difference Result 1241 states and 1858 transitions. [2021-08-25 20:31:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:43,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 159 [2021-08-25 20:31:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,397 INFO L225 Difference]: With dead ends: 1241 [2021-08-25 20:31:43,397 INFO L226 Difference]: Without dead ends: 821 [2021-08-25 20:31:43,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-08-25 20:31:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 819. [2021-08-25 20:31:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.4914425427872862) internal successors, (1220), 818 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1220 transitions. [2021-08-25 20:31:43,430 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1220 transitions. Word has length 159 [2021-08-25 20:31:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,430 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1220 transitions. [2021-08-25 20:31:43,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1220 transitions. [2021-08-25 20:31:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:31:43,431 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,432 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:43,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-08-25 20:31:43,432 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash 187706946, now seen corresponding path program 1 times [2021-08-25 20:31:43,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900547507] [2021-08-25 20:31:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-08-25 20:31:43,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900547507] [2021-08-25 20:31:43,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900547507] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:43,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116029743] [2021-08-25 20:31:43,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:43,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:43,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:43,484 INFO L87 Difference]: Start difference. First operand 819 states and 1220 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,710 INFO L93 Difference]: Finished difference Result 1663 states and 2480 transitions. [2021-08-25 20:31:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 159 [2021-08-25 20:31:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,711 INFO L225 Difference]: With dead ends: 1663 [2021-08-25 20:31:43,711 INFO L226 Difference]: Without dead ends: 863 [2021-08-25 20:31:43,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-08-25 20:31:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 819. [2021-08-25 20:31:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.488997555012225) internal successors, (1218), 818 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1218 transitions. [2021-08-25 20:31:43,740 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1218 transitions. Word has length 159 [2021-08-25 20:31:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,740 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1218 transitions. [2021-08-25 20:31:43,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1218 transitions. [2021-08-25 20:31:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:31:43,741 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,742 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:43,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-08-25 20:31:43,742 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,742 INFO L82 PathProgramCache]: Analyzing trace with hash -535038295, now seen corresponding path program 1 times [2021-08-25 20:31:43,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306468224] [2021-08-25 20:31:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-08-25 20:31:43,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306468224] [2021-08-25 20:31:43,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306468224] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:43,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421176494] [2021-08-25 20:31:43,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:43,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:43,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:43,790 INFO L87 Difference]: Start difference. First operand 819 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-08-25 20:31:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,861 INFO L93 Difference]: Finished difference Result 1646 states and 2451 transitions. [2021-08-25 20:31:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) Word has length 159 [2021-08-25 20:31:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:43,863 INFO L225 Difference]: With dead ends: 1646 [2021-08-25 20:31:43,863 INFO L226 Difference]: Without dead ends: 846 [2021-08-25 20:31:43,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-08-25 20:31:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-08-25 20:31:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4828402366863904) internal successors, (1253), 845 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1253 transitions. [2021-08-25 20:31:43,901 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1253 transitions. Word has length 159 [2021-08-25 20:31:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:43,901 INFO L470 AbstractCegarLoop]: Abstraction has 846 states and 1253 transitions. [2021-08-25 20:31:43,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-08-25 20:31:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1253 transitions. [2021-08-25 20:31:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-25 20:31:43,905 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:43,905 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:43,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-08-25 20:31:43,905 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:43,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:43,906 INFO L82 PathProgramCache]: Analyzing trace with hash -124427929, now seen corresponding path program 1 times [2021-08-25 20:31:43,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:43,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588247159] [2021-08-25 20:31:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:43,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-08-25 20:31:43,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:43,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588247159] [2021-08-25 20:31:43,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588247159] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:43,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:43,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:43,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079236404] [2021-08-25 20:31:43,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:43,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:43,940 INFO L87 Difference]: Start difference. First operand 846 states and 1253 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-08-25 20:31:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:43,998 INFO L93 Difference]: Finished difference Result 1675 states and 2487 transitions. [2021-08-25 20:31:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:43,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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) Word has length 159 [2021-08-25 20:31:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:44,000 INFO L225 Difference]: With dead ends: 1675 [2021-08-25 20:31:44,000 INFO L226 Difference]: Without dead ends: 848 [2021-08-25 20:31:44,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2021-08-25 20:31:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2021-08-25 20:31:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4817001180637543) internal successors, (1255), 847 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1255 transitions. [2021-08-25 20:31:44,040 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1255 transitions. Word has length 159 [2021-08-25 20:31:44,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:44,040 INFO L470 AbstractCegarLoop]: Abstraction has 848 states and 1255 transitions. [2021-08-25 20:31:44,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-08-25 20:31:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1255 transitions. [2021-08-25 20:31:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-25 20:31:44,042 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:44,042 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:44,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-08-25 20:31:44,042 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash 769642896, now seen corresponding path program 1 times [2021-08-25 20:31:44,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:44,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919809480] [2021-08-25 20:31:44,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:44,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:44,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:44,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919809480] [2021-08-25 20:31:44,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919809480] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:44,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:44,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:44,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133554812] [2021-08-25 20:31:44,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:44,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:44,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:44,092 INFO L87 Difference]: Start difference. First operand 848 states and 1255 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:44,379 INFO L93 Difference]: Finished difference Result 1731 states and 2558 transitions. [2021-08-25 20:31:44,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:44,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-08-25 20:31:44,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:44,381 INFO L225 Difference]: With dead ends: 1731 [2021-08-25 20:31:44,381 INFO L226 Difference]: Without dead ends: 904 [2021-08-25 20:31:44,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-08-25 20:31:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 863. [2021-08-25 20:31:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4779582366589328) internal successors, (1274), 862 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1274 transitions. [2021-08-25 20:31:44,422 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1274 transitions. Word has length 160 [2021-08-25 20:31:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:44,422 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1274 transitions. [2021-08-25 20:31:44,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1274 transitions. [2021-08-25 20:31:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-25 20:31:44,423 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:44,423 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:44,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-08-25 20:31:44,424 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1675384265, now seen corresponding path program 1 times [2021-08-25 20:31:44,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:44,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021600498] [2021-08-25 20:31:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:44,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:31:44,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:44,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021600498] [2021-08-25 20:31:44,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021600498] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:44,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:44,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:31:44,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68396752] [2021-08-25 20:31:44,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:31:44,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:44,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:31:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:44,513 INFO L87 Difference]: Start difference. First operand 863 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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-08-25 20:31:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:44,959 INFO L93 Difference]: Finished difference Result 1858 states and 2757 transitions. [2021-08-25 20:31:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:31:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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) Word has length 160 [2021-08-25 20:31:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:44,961 INFO L225 Difference]: With dead ends: 1858 [2021-08-25 20:31:44,961 INFO L226 Difference]: Without dead ends: 1016 [2021-08-25 20:31:44,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:31:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-08-25 20:31:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 929. [2021-08-25 20:31:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.5) internal successors, (1392), 928 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1392 transitions. [2021-08-25 20:31:44,997 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1392 transitions. Word has length 160 [2021-08-25 20:31:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:44,998 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1392 transitions. [2021-08-25 20:31:44,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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-08-25 20:31:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1392 transitions. [2021-08-25 20:31:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:31:44,999 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:44,999 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:44,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-08-25 20:31:45,000 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -175567548, now seen corresponding path program 1 times [2021-08-25 20:31:45,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164860321] [2021-08-25 20:31:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-25 20:31:45,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164860321] [2021-08-25 20:31:45,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164860321] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:45,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965974728] [2021-08-25 20:31:45,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:45,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:45,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:45,056 INFO L87 Difference]: Start difference. First operand 929 states and 1392 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,349 INFO L93 Difference]: Finished difference Result 1870 states and 2801 transitions. [2021-08-25 20:31:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 161 [2021-08-25 20:31:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,352 INFO L225 Difference]: With dead ends: 1870 [2021-08-25 20:31:45,352 INFO L226 Difference]: Without dead ends: 958 [2021-08-25 20:31:45,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-08-25 20:31:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 927. [2021-08-25 20:31:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 1.4989200863930885) internal successors, (1388), 926 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1388 transitions. [2021-08-25 20:31:45,401 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1388 transitions. Word has length 161 [2021-08-25 20:31:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,402 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1388 transitions. [2021-08-25 20:31:45,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1388 transitions. [2021-08-25 20:31:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-08-25 20:31:45,403 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,403 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:45,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-08-25 20:31:45,404 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -101278629, now seen corresponding path program 1 times [2021-08-25 20:31:45,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783900412] [2021-08-25 20:31:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:31:45,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783900412] [2021-08-25 20:31:45,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783900412] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:45,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020923143] [2021-08-25 20:31:45,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:45,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:45,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:45,457 INFO L87 Difference]: Start difference. First operand 927 states and 1388 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:45,748 INFO L93 Difference]: Finished difference Result 1861 states and 2791 transitions. [2021-08-25 20:31:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:45,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 163 [2021-08-25 20:31:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:45,751 INFO L225 Difference]: With dead ends: 1861 [2021-08-25 20:31:45,751 INFO L226 Difference]: Without dead ends: 955 [2021-08-25 20:31:45,752 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2021-08-25 20:31:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 927. [2021-08-25 20:31:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 1.4978401727861772) internal successors, (1387), 926 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1387 transitions. [2021-08-25 20:31:45,795 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1387 transitions. Word has length 163 [2021-08-25 20:31:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:45,796 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1387 transitions. [2021-08-25 20:31:45,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1387 transitions. [2021-08-25 20:31:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:31:45,797 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:45,797 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:45,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-08-25 20:31:45,798 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1247949926, now seen corresponding path program 1 times [2021-08-25 20:31:45,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:45,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508681986] [2021-08-25 20:31:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:45,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:31:45,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:45,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508681986] [2021-08-25 20:31:45,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508681986] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:45,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:45,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:45,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802010919] [2021-08-25 20:31:45,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:45,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:45,852 INFO L87 Difference]: Start difference. First operand 927 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:46,125 INFO L93 Difference]: Finished difference Result 1859 states and 2787 transitions. [2021-08-25 20:31:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 164 [2021-08-25 20:31:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:46,127 INFO L225 Difference]: With dead ends: 1859 [2021-08-25 20:31:46,127 INFO L226 Difference]: Without dead ends: 953 [2021-08-25 20:31:46,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2021-08-25 20:31:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2021-08-25 20:31:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 1.4967602591792657) internal successors, (1386), 926 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1386 transitions. [2021-08-25 20:31:46,166 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1386 transitions. Word has length 164 [2021-08-25 20:31:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:46,167 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1386 transitions. [2021-08-25 20:31:46,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1386 transitions. [2021-08-25 20:31:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:31:46,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:46,169 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:46,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-08-25 20:31:46,169 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:46,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2130185036, now seen corresponding path program 1 times [2021-08-25 20:31:46,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:46,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598976969] [2021-08-25 20:31:46,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:46,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-08-25 20:31:46,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:46,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598976969] [2021-08-25 20:31:46,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598976969] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:46,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:46,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:46,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782706409] [2021-08-25 20:31:46,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:46,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,222 INFO L87 Difference]: Start difference. First operand 927 states and 1386 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:46,313 INFO L93 Difference]: Finished difference Result 2291 states and 3441 transitions. [2021-08-25 20:31:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:46,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 164 [2021-08-25 20:31:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:46,316 INFO L225 Difference]: With dead ends: 2291 [2021-08-25 20:31:46,316 INFO L226 Difference]: Without dead ends: 1385 [2021-08-25 20:31:46,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2021-08-25 20:31:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1385. [2021-08-25 20:31:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 1.4971098265895955) internal successors, (2072), 1384 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2072 transitions. [2021-08-25 20:31:46,378 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2072 transitions. Word has length 164 [2021-08-25 20:31:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:46,379 INFO L470 AbstractCegarLoop]: Abstraction has 1385 states and 2072 transitions. [2021-08-25 20:31:46,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2072 transitions. [2021-08-25 20:31:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 20:31:46,380 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:46,381 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:46,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-08-25 20:31:46,381 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:46,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:46,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1370865435, now seen corresponding path program 1 times [2021-08-25 20:31:46,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:46,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602717174] [2021-08-25 20:31:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:46,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:31:46,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:46,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602717174] [2021-08-25 20:31:46,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602717174] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:46,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:46,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:31:46,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010897690] [2021-08-25 20:31:46,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:31:46,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:46,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:31:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,440 INFO L87 Difference]: Start difference. First operand 1385 states and 2072 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:46,554 INFO L93 Difference]: Finished difference Result 3205 states and 4808 transitions. [2021-08-25 20:31:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:31:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 165 [2021-08-25 20:31:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:46,557 INFO L225 Difference]: With dead ends: 3205 [2021-08-25 20:31:46,558 INFO L226 Difference]: Without dead ends: 1841 [2021-08-25 20:31:46,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:31:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2021-08-25 20:31:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1837. [2021-08-25 20:31:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.4983660130718954) internal successors, (2751), 1836 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2751 transitions. [2021-08-25 20:31:46,661 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2751 transitions. Word has length 165 [2021-08-25 20:31:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:46,661 INFO L470 AbstractCegarLoop]: Abstraction has 1837 states and 2751 transitions. [2021-08-25 20:31:46,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2751 transitions. [2021-08-25 20:31:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-08-25 20:31:46,663 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:46,663 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:46,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-08-25 20:31:46,663 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:46,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1229383242, now seen corresponding path program 1 times [2021-08-25 20:31:46,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:46,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636665293] [2021-08-25 20:31:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:46,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:31:46,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:46,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636665293] [2021-08-25 20:31:46,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636665293] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:46,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:46,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:46,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045951332] [2021-08-25 20:31:46,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:46,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:46,714 INFO L87 Difference]: Start difference. First operand 1837 states and 2751 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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-08-25 20:31:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:47,109 INFO L93 Difference]: Finished difference Result 3798 states and 5665 transitions. [2021-08-25 20:31:47,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:47,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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 170 [2021-08-25 20:31:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:47,114 INFO L225 Difference]: With dead ends: 3798 [2021-08-25 20:31:47,114 INFO L226 Difference]: Without dead ends: 1982 [2021-08-25 20:31:47,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-08-25 20:31:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2021-08-25 20:31:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.4961873638344227) internal successors, (2747), 1836 states have internal predecessors, (2747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2747 transitions. [2021-08-25 20:31:47,199 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2747 transitions. Word has length 170 [2021-08-25 20:31:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:47,199 INFO L470 AbstractCegarLoop]: Abstraction has 1837 states and 2747 transitions. [2021-08-25 20:31:47,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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-08-25 20:31:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2747 transitions. [2021-08-25 20:31:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-08-25 20:31:47,201 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:47,201 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:47,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-08-25 20:31:47,202 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2007517807, now seen corresponding path program 1 times [2021-08-25 20:31:47,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:47,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300636711] [2021-08-25 20:31:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:47,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:31:47,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:47,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300636711] [2021-08-25 20:31:47,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300636711] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:47,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:47,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:47,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23425192] [2021-08-25 20:31:47,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:47,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:47,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:47,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:47,250 INFO L87 Difference]: Start difference. First operand 1837 states and 2747 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:47,587 INFO L93 Difference]: Finished difference Result 3798 states and 5657 transitions. [2021-08-25 20:31:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:47,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2021-08-25 20:31:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:47,590 INFO L225 Difference]: With dead ends: 3798 [2021-08-25 20:31:47,590 INFO L226 Difference]: Without dead ends: 1982 [2021-08-25 20:31:47,591 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-08-25 20:31:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2021-08-25 20:31:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.4940087145969498) internal successors, (2743), 1836 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2743 transitions. [2021-08-25 20:31:47,663 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2743 transitions. Word has length 171 [2021-08-25 20:31:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:47,663 INFO L470 AbstractCegarLoop]: Abstraction has 1837 states and 2743 transitions. [2021-08-25 20:31:47,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2743 transitions. [2021-08-25 20:31:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-08-25 20:31:47,665 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:47,665 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:47,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-08-25 20:31:47,666 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1981654735, now seen corresponding path program 1 times [2021-08-25 20:31:47,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:47,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492350864] [2021-08-25 20:31:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:47,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:31:47,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:47,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492350864] [2021-08-25 20:31:47,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492350864] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:47,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:47,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:47,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707776882] [2021-08-25 20:31:47,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:47,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:47,716 INFO L87 Difference]: Start difference. First operand 1837 states and 2743 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-08-25 20:31:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:48,065 INFO L93 Difference]: Finished difference Result 3798 states and 5649 transitions. [2021-08-25 20:31:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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 172 [2021-08-25 20:31:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:48,072 INFO L225 Difference]: With dead ends: 3798 [2021-08-25 20:31:48,072 INFO L226 Difference]: Without dead ends: 1982 [2021-08-25 20:31:48,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-08-25 20:31:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2021-08-25 20:31:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.4918300653594772) internal successors, (2739), 1836 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2739 transitions. [2021-08-25 20:31:48,156 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2739 transitions. Word has length 172 [2021-08-25 20:31:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:48,157 INFO L470 AbstractCegarLoop]: Abstraction has 1837 states and 2739 transitions. [2021-08-25 20:31:48,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-08-25 20:31:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2739 transitions. [2021-08-25 20:31:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:31:48,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:48,159 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:48,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-08-25 20:31:48,160 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:48,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1493298604, now seen corresponding path program 1 times [2021-08-25 20:31:48,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:48,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780388263] [2021-08-25 20:31:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:48,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:31:48,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:48,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780388263] [2021-08-25 20:31:48,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780388263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:48,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:48,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:31:48,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372833622] [2021-08-25 20:31:48,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:48,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:48,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:48,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:48,211 INFO L87 Difference]: Start difference. First operand 1837 states and 2739 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:48,552 INFO L93 Difference]: Finished difference Result 3758 states and 5593 transitions. [2021-08-25 20:31:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 173 [2021-08-25 20:31:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:48,556 INFO L225 Difference]: With dead ends: 3758 [2021-08-25 20:31:48,556 INFO L226 Difference]: Without dead ends: 1942 [2021-08-25 20:31:48,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2021-08-25 20:31:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1837. [2021-08-25 20:31:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.4896514161220045) internal successors, (2735), 1836 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2735 transitions. [2021-08-25 20:31:48,655 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2735 transitions. Word has length 173 [2021-08-25 20:31:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:48,656 INFO L470 AbstractCegarLoop]: Abstraction has 1837 states and 2735 transitions. [2021-08-25 20:31:48,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2735 transitions. [2021-08-25 20:31:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-08-25 20:31:48,657 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:48,658 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:48,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-08-25 20:31:48,658 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1144465868, now seen corresponding path program 1 times [2021-08-25 20:31:48,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:48,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829851117] [2021-08-25 20:31:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:48,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:31:48,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:48,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829851117] [2021-08-25 20:31:48,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829851117] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:48,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:48,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:31:48,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700943988] [2021-08-25 20:31:48,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:31:48,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:31:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:48,754 INFO L87 Difference]: Start difference. First operand 1837 states and 2735 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:49,193 INFO L93 Difference]: Finished difference Result 4097 states and 6119 transitions. [2021-08-25 20:31:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:49,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 175 [2021-08-25 20:31:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:49,196 INFO L225 Difference]: With dead ends: 4097 [2021-08-25 20:31:49,196 INFO L226 Difference]: Without dead ends: 2281 [2021-08-25 20:31:49,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:31:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2021-08-25 20:31:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1996. [2021-08-25 20:31:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 1.5147869674185463) internal successors, (3022), 1995 states have internal predecessors, (3022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 3022 transitions. [2021-08-25 20:31:49,302 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 3022 transitions. Word has length 175 [2021-08-25 20:31:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:49,303 INFO L470 AbstractCegarLoop]: Abstraction has 1996 states and 3022 transitions. [2021-08-25 20:31:49,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 3022 transitions. [2021-08-25 20:31:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-25 20:31:49,305 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:49,305 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:49,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-08-25 20:31:49,306 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1112170898, now seen corresponding path program 1 times [2021-08-25 20:31:49,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:49,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639092405] [2021-08-25 20:31:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:49,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-08-25 20:31:49,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:49,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639092405] [2021-08-25 20:31:49,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639092405] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:49,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:49,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:31:49,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302123130] [2021-08-25 20:31:49,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:31:49,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:49,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:31:49,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:49,408 INFO L87 Difference]: Start difference. First operand 1996 states and 3022 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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-08-25 20:31:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:49,871 INFO L93 Difference]: Finished difference Result 4368 states and 6626 transitions. [2021-08-25 20:31:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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 176 [2021-08-25 20:31:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:49,873 INFO L225 Difference]: With dead ends: 4368 [2021-08-25 20:31:49,873 INFO L226 Difference]: Without dead ends: 2393 [2021-08-25 20:31:49,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:31:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2021-08-25 20:31:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2106. [2021-08-25 20:31:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.5410926365795725) internal successors, (3244), 2105 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3244 transitions. [2021-08-25 20:31:49,942 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3244 transitions. Word has length 176 [2021-08-25 20:31:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:49,942 INFO L470 AbstractCegarLoop]: Abstraction has 2106 states and 3244 transitions. [2021-08-25 20:31:49,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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-08-25 20:31:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3244 transitions. [2021-08-25 20:31:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-08-25 20:31:49,943 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:49,944 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:49,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-08-25 20:31:49,944 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1394677973, now seen corresponding path program 1 times [2021-08-25 20:31:49,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:31:49,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880568607] [2021-08-25 20:31:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:49,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:31:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:31:50,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:31:50,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880568607] [2021-08-25 20:31:50,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880568607] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:31:50,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497940426] [2021-08-25 20:31:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:50,273 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:31:50,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:31:50,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:31:50,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:31:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:50,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-25 20:31:50,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:31:50,788 INFO L354 Elim1Store]: treesize reduction 199, result has 12.3 percent of original size [2021-08-25 20:31:50,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2021-08-25 20:31:50,802 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:31:50,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2021-08-25 20:31:50,814 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:31:50,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-25 20:31:50,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-08-25 20:31:50,865 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:31:50,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:31:50,934 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:31:50,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:31:50,968 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:31:50,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:31:51,055 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:31:51,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:31:51,075 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-25 20:31:51,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-08-25 20:31:51,172 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:31:51,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:31:51,268 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:31:51,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:31:51,317 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-25 20:31:51,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2021-08-25 20:31:51,423 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:31:51,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-25 20:31:51,496 INFO L354 Elim1Store]: treesize reduction 160, result has 16.2 percent of original size [2021-08-25 20:31:51,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 275 treesize of output 205 [2021-08-25 20:31:51,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 215 [2021-08-25 20:31:51,525 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:31:51,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 287 [2021-08-25 20:31:51,584 INFO L354 Elim1Store]: treesize reduction 244, result has 13.2 percent of original size [2021-08-25 20:31:51,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 359 treesize of output 309 [2021-08-25 20:31:51,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-08-25 20:31:51,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:31:51,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-08-25 20:31:51,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32593111] [2021-08-25 20:31:51,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 20:31:51,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:31:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 20:31:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:31:51,596 INFO L87 Difference]: Start difference. First operand 2106 states and 3244 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-25 20:31:51,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:31:51,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:31:51,798 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2bd2d7e9 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:778) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-25 20:31:51,802 INFO L168 Benchmark]: Toolchain (without parser) took 44041.51 ms. Allocated memory was 58.7 MB in the beginning and 497.0 MB in the end (delta: 438.3 MB). Free memory was 35.7 MB in the beginning and 181.6 MB in the end (delta: -145.9 MB). Peak memory consumption was 290.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:51,802 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 58.7 MB. Free memory was 40.4 MB in the beginning and 40.4 MB in the end (delta: 46.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:31:51,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.95 ms. Allocated memory was 58.7 MB in the beginning and 77.6 MB in the end (delta: 18.9 MB). Free memory was 35.5 MB in the beginning and 43.5 MB in the end (delta: -8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:51,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.52 ms. Allocated memory is still 77.6 MB. Free memory was 43.5 MB in the beginning and 57.2 MB in the end (delta: -13.8 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:51,803 INFO L168 Benchmark]: Boogie Preprocessor took 75.74 ms. Allocated memory is still 77.6 MB. Free memory was 57.2 MB in the beginning and 50.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:51,803 INFO L168 Benchmark]: RCFGBuilder took 958.70 ms. Allocated memory was 77.6 MB in the beginning and 107.0 MB in the end (delta: 29.4 MB). Free memory was 50.5 MB in the beginning and 51.8 MB in the end (delta: -1.4 MB). Peak memory consumption was 31.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:51,803 INFO L168 Benchmark]: TraceAbstraction took 42263.42 ms. Allocated memory was 107.0 MB in the beginning and 497.0 MB in the end (delta: 390.1 MB). Free memory was 51.8 MB in the beginning and 181.6 MB in the end (delta: -129.8 MB). Peak memory consumption was 259.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:31:51,804 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.18 ms. Allocated memory is still 58.7 MB. Free memory was 40.4 MB in the beginning and 40.4 MB in the end (delta: 46.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 625.95 ms. Allocated memory was 58.7 MB in the beginning and 77.6 MB in the end (delta: 18.9 MB). Free memory was 35.5 MB in the beginning and 43.5 MB in the end (delta: -8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 101.52 ms. Allocated memory is still 77.6 MB. Free memory was 43.5 MB in the beginning and 57.2 MB in the end (delta: -13.8 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.74 ms. Allocated memory is still 77.6 MB. Free memory was 57.2 MB in the beginning and 50.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 958.70 ms. Allocated memory was 77.6 MB in the beginning and 107.0 MB in the end (delta: 29.4 MB). Free memory was 50.5 MB in the beginning and 51.8 MB in the end (delta: -1.4 MB). Peak memory consumption was 31.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 42263.42 ms. Allocated memory was 107.0 MB in the beginning and 497.0 MB in the end (delta: 390.1 MB). Free memory was 51.8 MB in the beginning and 181.6 MB in the end (delta: -129.8 MB). Peak memory consumption was 259.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2bd2d7e9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2bd2d7e9: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-25 20:31:51,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:31:53,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:31:53,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:31:53,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:31:53,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:31:53,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:31:53,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:31:53,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:31:53,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:31:53,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:31:53,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:31:53,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:31:53,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:31:53,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:31:53,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:31:53,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:31:53,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:31:53,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:31:53,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:31:53,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:31:53,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:31:53,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:31:53,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:31:53,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:31:53,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:31:53,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:31:53,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:31:53,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:31:53,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:31:53,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:31:53,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:31:53,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:31:53,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:31:53,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:31:53,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:31:53,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:31:53,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:31:53,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:31:53,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:31:53,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:31:53,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:31:53,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:31:53,772 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:31:53,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:31:53,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:31:53,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:31:53,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:31:53,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:31:53,776 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:31:53,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:31:53,776 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:31:53,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:31:53,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:31:53,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:31:53,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:31:53,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:31:53,778 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:31:53,778 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:31:53,778 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:31:53,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:31:53,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:31:53,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:31:53,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:31:53,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:31:53,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:31:53,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:53,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:31:53,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:31:53,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:31:53,780 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:31:53,781 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:31:53,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:31:53,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:31:53,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:31:53,781 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 -> 6798e3458bb0edb710871ba474a89df614e6e21e [2021-08-25 20:31:54,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:31:54,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:31:54,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:31:54,077 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:31:54,077 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:31:54,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c [2021-08-25 20:31:54,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394f9b4d3/c1c24415b617493da8a6e3cc3ff33d4d/FLAG7c2536b47 [2021-08-25 20:31:54,719 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:31:54,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c [2021-08-25 20:31:54,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394f9b4d3/c1c24415b617493da8a6e3cc3ff33d4d/FLAG7c2536b47 [2021-08-25 20:31:55,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394f9b4d3/c1c24415b617493da8a6e3cc3ff33d4d [2021-08-25 20:31:55,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:31:55,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:31:55,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:55,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:31:55,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:31:55,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130dc132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55, skipping insertion in model container [2021-08-25 20:31:55,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:31:55,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:31:55,600 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c[72131,72144] [2021-08-25 20:31:55,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:55,629 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:31:55,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-2.c[72131,72144] [2021-08-25 20:31:55,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:31:55,763 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:31:55,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55 WrapperNode [2021-08-25 20:31:55,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:31:55,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:55,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:31:55,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:31:55,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:31:55,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:31:55,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:31:55,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:31:55,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:31:55,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:31:55,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:31:55,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:31:55,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (1/1) ... [2021-08-25 20:31:55,945 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:31:55,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:31:55,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:31:55,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:31:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:31:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:31:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:31:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:31:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:31:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:31:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:31:56,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:31:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:31:56,269 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:31:57,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:31:57,561 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:31:57,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:31:57,566 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:31:57,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:57 BoogieIcfgContainer [2021-08-25 20:31:57,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:31:57,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:31:57,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:31:57,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:31:57,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:31:55" (1/3) ... [2021-08-25 20:31:57,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f0c89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:57, skipping insertion in model container [2021-08-25 20:31:57,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:31:55" (2/3) ... [2021-08-25 20:31:57,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f0c89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:31:57, skipping insertion in model container [2021-08-25 20:31:57,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:57" (3/3) ... [2021-08-25 20:31:57,575 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2021-08-25 20:31:57,580 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:31:57,580 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:31:57,628 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:31:57,632 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:31:57,633 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:31:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 144 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:31:57,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:57,659 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:57,660 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1126320416, now seen corresponding path program 1 times [2021-08-25 20:31:57,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:31:57,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575461384] [2021-08-25 20:31:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:57,679 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:31:57,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:31:57,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:31:57,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:31:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:31:57,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:31:57,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:31:57,981 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:31:57,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:31:58,042 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:31:58,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:31:58,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:31:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:58,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:31:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:31:58,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:31:58,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575461384] [2021-08-25 20:31:58,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575461384] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:31:58,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:31:58,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:31:58,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845985491] [2021-08-25 20:31:58,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:31:58,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:31:58,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:31:58,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:31:58,432 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 144 states have internal predecessors, (245), 0 states have call successors, (0), 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 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:31:59,739 INFO L93 Difference]: Finished difference Result 317 states and 535 transitions. [2021-08-25 20:31:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:31:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-08-25 20:31:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:31:59,749 INFO L225 Difference]: With dead ends: 317 [2021-08-25 20:31:59,749 INFO L226 Difference]: Without dead ends: 160 [2021-08-25 20:31:59,752 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:31:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-25 20:31:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-08-25 20:31:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 142 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2021-08-25 20:31:59,786 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 41 [2021-08-25 20:31:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:31:59,787 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2021-08-25 20:31:59,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:31:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2021-08-25 20:31:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-25 20:31:59,789 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:31:59,789 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:31:59,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-25 20:31:59,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:31:59,990 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:31:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:31:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash -589138407, now seen corresponding path program 1 times [2021-08-25 20:31:59,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:31:59,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536765885] [2021-08-25 20:31:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:31:59,992 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:31:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:31:59,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:00,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:32:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:00,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:32:00,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:00,284 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:32:00,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:32:00,332 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:32:00,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:32:00,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:00,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:00,710 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:00,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536765885] [2021-08-25 20:32:00,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536765885] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:00,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:00,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:00,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737277370] [2021-08-25 20:32:00,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:00,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:00,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:00,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:00,714 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:03,779 INFO L93 Difference]: Finished difference Result 399 states and 609 transitions. [2021-08-25 20:32:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 54 [2021-08-25 20:32:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:03,787 INFO L225 Difference]: With dead ends: 399 [2021-08-25 20:32:03,788 INFO L226 Difference]: Without dead ends: 275 [2021-08-25 20:32:03,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 54.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-25 20:32:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 159. [2021-08-25 20:32:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.5506329113924051) internal successors, (245), 158 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 245 transitions. [2021-08-25 20:32:03,809 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 245 transitions. Word has length 54 [2021-08-25 20:32:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:03,809 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 245 transitions. [2021-08-25 20:32:03,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 245 transitions. [2021-08-25 20:32:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:32:03,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:03,811 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:03,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-25 20:32:04,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:04,012 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash -873991893, now seen corresponding path program 1 times [2021-08-25 20:32:04,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:04,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495587915] [2021-08-25 20:32:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:04,013 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:04,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:04,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:32:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:04,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:04,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:04,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 73 [2021-08-25 20:32:04,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2021-08-25 20:32:05,037 INFO L354 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2021-08-25 20:32:05,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 31 [2021-08-25 20:32:05,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:05,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:05,376 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:05,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495587915] [2021-08-25 20:32:05,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495587915] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:05,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:05,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:32:05,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248329084] [2021-08-25 20:32:05,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:32:05,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:32:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:32:05,378 INFO L87 Difference]: Start difference. First operand 159 states and 245 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:06,768 INFO L93 Difference]: Finished difference Result 328 states and 504 transitions. [2021-08-25 20:32:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:32:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-25 20:32:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:06,771 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:32:06,771 INFO L226 Difference]: Without dead ends: 188 [2021-08-25 20:32:06,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:32:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-25 20:32:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2021-08-25 20:32:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.5574712643678161) internal successors, (271), 174 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 271 transitions. [2021-08-25 20:32:06,781 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 271 transitions. Word has length 55 [2021-08-25 20:32:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:06,782 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 271 transitions. [2021-08-25 20:32:06,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 271 transitions. [2021-08-25 20:32:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:32:06,785 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:06,789 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:06,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-25 20:32:06,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:06,999 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:07,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2010193898, now seen corresponding path program 1 times [2021-08-25 20:32:07,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:07,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292613736] [2021-08-25 20:32:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:07,001 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:07,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:07,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:32:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:07,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:32:07,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:07,307 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:32:07,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:32:07,346 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:32:07,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:32:07,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:07,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:07,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:07,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292613736] [2021-08-25 20:32:07,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292613736] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:07,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:07,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:07,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611585888] [2021-08-25 20:32:07,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:07,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:07,746 INFO L87 Difference]: Start difference. First operand 175 states and 271 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:11,148 INFO L93 Difference]: Finished difference Result 445 states and 683 transitions. [2021-08-25 20:32:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 55 [2021-08-25 20:32:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:11,151 INFO L225 Difference]: With dead ends: 445 [2021-08-25 20:32:11,151 INFO L226 Difference]: Without dead ends: 289 [2021-08-25 20:32:11,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 44.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-25 20:32:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 176. [2021-08-25 20:32:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.5485714285714285) internal successors, (271), 175 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. [2021-08-25 20:32:11,160 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 55 [2021-08-25 20:32:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:11,160 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. [2021-08-25 20:32:11,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. [2021-08-25 20:32:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:32:11,161 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:11,162 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:11,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:11,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:11,375 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:11,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:11,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1549428566, now seen corresponding path program 1 times [2021-08-25 20:32:11,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:11,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557592763] [2021-08-25 20:32:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:11,385 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:11,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:11,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:32:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:11,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:11,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:11,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:32:11,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:11,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:12,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:12,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557592763] [2021-08-25 20:32:12,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557592763] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:12,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:12,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:12,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743005164] [2021-08-25 20:32:12,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:12,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:12,191 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-08-25 20:32:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:16,047 INFO L93 Difference]: Finished difference Result 551 states and 847 transitions. [2021-08-25 20:32:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:16,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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 55 [2021-08-25 20:32:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:16,052 INFO L225 Difference]: With dead ends: 551 [2021-08-25 20:32:16,052 INFO L226 Difference]: Without dead ends: 394 [2021-08-25 20:32:16,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-08-25 20:32:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 216. [2021-08-25 20:32:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.5906976744186045) internal successors, (342), 215 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 342 transitions. [2021-08-25 20:32:16,061 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 342 transitions. Word has length 55 [2021-08-25 20:32:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:16,062 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 342 transitions. [2021-08-25 20:32:16,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-08-25 20:32:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 342 transitions. [2021-08-25 20:32:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-25 20:32:16,063 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:16,063 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:16,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:16,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:16,264 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash 781112648, now seen corresponding path program 1 times [2021-08-25 20:32:16,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:16,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756286703] [2021-08-25 20:32:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:16,265 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:16,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:16,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 20:32:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:16,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:16,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:16,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:32:16,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:16,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:16,986 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:16,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756286703] [2021-08-25 20:32:16,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756286703] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:16,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:16,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:16,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891236258] [2021-08-25 20:32:16,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:16,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:16,988 INFO L87 Difference]: Start difference. First operand 216 states and 342 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:20,234 INFO L93 Difference]: Finished difference Result 607 states and 953 transitions. [2021-08-25 20:32:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:20,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 56 [2021-08-25 20:32:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:20,237 INFO L225 Difference]: With dead ends: 607 [2021-08-25 20:32:20,237 INFO L226 Difference]: Without dead ends: 410 [2021-08-25 20:32:20,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-08-25 20:32:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 239. [2021-08-25 20:32:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 238 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 387 transitions. [2021-08-25 20:32:20,244 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 387 transitions. Word has length 56 [2021-08-25 20:32:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:20,245 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 387 transitions. [2021-08-25 20:32:20,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 387 transitions. [2021-08-25 20:32:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:32:20,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:20,249 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08-25 20:32:20,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:20,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:20,450 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash 60882110, now seen corresponding path program 1 times [2021-08-25 20:32:20,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:20,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286825993] [2021-08-25 20:32:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:20,454 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:20,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:20,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 20:32:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:20,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:20,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:20,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:32:20,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:21,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:21,409 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:21,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286825993] [2021-08-25 20:32:21,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286825993] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:21,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:21,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:21,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358718939] [2021-08-25 20:32:21,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:21,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:21,411 INFO L87 Difference]: Start difference. First operand 239 states and 387 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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-08-25 20:32:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:24,778 INFO L93 Difference]: Finished difference Result 703 states and 1130 transitions. [2021-08-25 20:32:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:24,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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 84 [2021-08-25 20:32:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:24,781 INFO L225 Difference]: With dead ends: 703 [2021-08-25 20:32:24,782 INFO L226 Difference]: Without dead ends: 483 [2021-08-25 20:32:24,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-08-25 20:32:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 303. [2021-08-25 20:32:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.6523178807947019) internal successors, (499), 302 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 499 transitions. [2021-08-25 20:32:24,793 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 499 transitions. Word has length 84 [2021-08-25 20:32:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:24,794 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 499 transitions. [2021-08-25 20:32:24,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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-08-25 20:32:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 499 transitions. [2021-08-25 20:32:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:32:24,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:24,795 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:32:24,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:25,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:25,001 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash -626492070, now seen corresponding path program 1 times [2021-08-25 20:32:25,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:25,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301637339] [2021-08-25 20:32:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:25,002 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:25,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:25,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 20:32:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:25,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:25,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:25,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:32:25,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:25,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:26,066 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:26,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301637339] [2021-08-25 20:32:26,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301637339] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:26,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:26,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:26,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072085715] [2021-08-25 20:32:26,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:26,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:26,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:26,068 INFO L87 Difference]: Start difference. First operand 303 states and 499 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:29,125 INFO L93 Difference]: Finished difference Result 795 states and 1285 transitions. [2021-08-25 20:32:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:29,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-25 20:32:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:29,129 INFO L225 Difference]: With dead ends: 795 [2021-08-25 20:32:29,129 INFO L226 Difference]: Without dead ends: 511 [2021-08-25 20:32:29,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 45.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-08-25 20:32:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 340. [2021-08-25 20:32:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.6607669616519174) internal successors, (563), 339 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 563 transitions. [2021-08-25 20:32:29,139 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 563 transitions. Word has length 89 [2021-08-25 20:32:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:29,139 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 563 transitions. [2021-08-25 20:32:29,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 563 transitions. [2021-08-25 20:32:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-25 20:32:29,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:29,141 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:32:29,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-08-25 20:32:29,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:29,363 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -825947284, now seen corresponding path program 1 times [2021-08-25 20:32:29,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:29,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137051556] [2021-08-25 20:32:29,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:29,365 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:29,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:29,365 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:29,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 20:32:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:29,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:29,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:29,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:32:30,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:30,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:30,415 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:30,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137051556] [2021-08-25 20:32:30,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137051556] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:30,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:30,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:30,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319640266] [2021-08-25 20:32:30,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:30,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:30,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:30,417 INFO L87 Difference]: Start difference. First operand 340 states and 563 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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-08-25 20:32:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:34,094 INFO L93 Difference]: Finished difference Result 827 states and 1340 transitions. [2021-08-25 20:32:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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) Word has length 90 [2021-08-25 20:32:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:34,097 INFO L225 Difference]: With dead ends: 827 [2021-08-25 20:32:34,097 INFO L226 Difference]: Without dead ends: 506 [2021-08-25 20:32:34,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-08-25 20:32:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 340. [2021-08-25 20:32:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.654867256637168) internal successors, (561), 339 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 561 transitions. [2021-08-25 20:32:34,106 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 561 transitions. Word has length 90 [2021-08-25 20:32:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:34,106 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 561 transitions. [2021-08-25 20:32:34,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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-08-25 20:32:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 561 transitions. [2021-08-25 20:32:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:32:34,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:34,108 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:34,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:34,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:34,319 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash 839242534, now seen corresponding path program 1 times [2021-08-25 20:32:34,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:34,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199041585] [2021-08-25 20:32:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:34,320 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:34,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:34,321 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:34,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 20:32:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:34,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:32:34,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:34,905 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:32:34,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:32:34,940 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:32:34,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:32:34,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:35,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:35,528 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:35,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199041585] [2021-08-25 20:32:35,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199041585] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:35,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:35,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:35,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467270301] [2021-08-25 20:32:35,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:35,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:35,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:35,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:35,530 INFO L87 Difference]: Start difference. First operand 340 states and 561 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:38,048 INFO L93 Difference]: Finished difference Result 749 states and 1214 transitions. [2021-08-25 20:32:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 97 [2021-08-25 20:32:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:38,051 INFO L225 Difference]: With dead ends: 749 [2021-08-25 20:32:38,051 INFO L226 Difference]: Without dead ends: 428 [2021-08-25 20:32:38,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-08-25 20:32:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 340. [2021-08-25 20:32:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.6342182890855457) internal successors, (554), 339 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2021-08-25 20:32:38,061 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 97 [2021-08-25 20:32:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:38,061 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2021-08-25 20:32:38,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2021-08-25 20:32:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:32:38,062 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:38,062 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:38,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:38,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:38,281 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1861579846, now seen corresponding path program 1 times [2021-08-25 20:32:38,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:38,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045864788] [2021-08-25 20:32:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:38,282 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:38,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:38,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 20:32:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:38,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:32:38,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:38,908 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:32:38,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:32:38,951 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:32:38,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:32:38,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:39,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:39,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:39,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045864788] [2021-08-25 20:32:39,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045864788] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:39,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:39,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:39,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985662996] [2021-08-25 20:32:39,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:39,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:39,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:39,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:39,508 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:42,266 INFO L93 Difference]: Finished difference Result 749 states and 1201 transitions. [2021-08-25 20:32:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:42,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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) Word has length 97 [2021-08-25 20:32:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:42,268 INFO L225 Difference]: With dead ends: 749 [2021-08-25 20:32:42,269 INFO L226 Difference]: Without dead ends: 428 [2021-08-25 20:32:42,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 44.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-08-25 20:32:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 340. [2021-08-25 20:32:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.6135693215339233) internal successors, (547), 339 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 547 transitions. [2021-08-25 20:32:42,278 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 547 transitions. Word has length 97 [2021-08-25 20:32:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:42,278 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 547 transitions. [2021-08-25 20:32:42,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 547 transitions. [2021-08-25 20:32:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:32:42,280 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:42,280 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:42,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:42,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:42,494 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1206787165, now seen corresponding path program 1 times [2021-08-25 20:32:42,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:42,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895863339] [2021-08-25 20:32:42,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:42,495 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:42,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:42,496 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:42,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 20:32:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:43,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:32:43,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:43,204 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:32:43,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:32:43,249 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:32:43,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:32:43,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:43,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:43,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:43,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895863339] [2021-08-25 20:32:43,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895863339] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:43,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:43,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:43,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654013771] [2021-08-25 20:32:43,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:43,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:43,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:43,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:43,806 INFO L87 Difference]: Start difference. First operand 340 states and 547 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:46,913 INFO L93 Difference]: Finished difference Result 749 states and 1188 transitions. [2021-08-25 20:32:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 98 [2021-08-25 20:32:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:46,915 INFO L225 Difference]: With dead ends: 749 [2021-08-25 20:32:46,915 INFO L226 Difference]: Without dead ends: 428 [2021-08-25 20:32:46,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-08-25 20:32:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 340. [2021-08-25 20:32:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.592920353982301) internal successors, (540), 339 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 540 transitions. [2021-08-25 20:32:46,924 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 540 transitions. Word has length 98 [2021-08-25 20:32:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:46,924 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 540 transitions. [2021-08-25 20:32:46,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 540 transitions. [2021-08-25 20:32:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:32:46,926 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:46,926 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08-25 20:32:46,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:47,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:47,156 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:47,156 INFO L82 PathProgramCache]: Analyzing trace with hash -541945670, now seen corresponding path program 1 times [2021-08-25 20:32:47,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:47,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588482979] [2021-08-25 20:32:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:47,157 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:47,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:47,158 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:47,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 20:32:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:47,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:47,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:47,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:32:48,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:48,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:48,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:48,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588482979] [2021-08-25 20:32:48,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588482979] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:48,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:48,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:48,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913466115] [2021-08-25 20:32:48,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:48,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:48,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:48,420 INFO L87 Difference]: Start difference. First operand 340 states and 540 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 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-08-25 20:32:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:51,393 INFO L93 Difference]: Finished difference Result 865 states and 1356 transitions. [2021-08-25 20:32:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 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) Word has length 98 [2021-08-25 20:32:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:51,396 INFO L225 Difference]: With dead ends: 865 [2021-08-25 20:32:51,396 INFO L226 Difference]: Without dead ends: 544 [2021-08-25 20:32:51,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-08-25 20:32:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 383. [2021-08-25 20:32:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5968586387434556) internal successors, (610), 382 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 610 transitions. [2021-08-25 20:32:51,406 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 610 transitions. Word has length 98 [2021-08-25 20:32:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:51,406 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 610 transitions. [2021-08-25 20:32:51,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 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-08-25 20:32:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 610 transitions. [2021-08-25 20:32:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:32:51,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:51,408 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:51,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:51,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:51,620 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1776290209, now seen corresponding path program 1 times [2021-08-25 20:32:51,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:51,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133055724] [2021-08-25 20:32:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:51,621 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:51,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:51,623 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:32:51,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-25 20:32:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:52,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:32:52,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:52,437 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:32:52,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:32:52,465 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:32:52,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:32:52,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:52,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:32:52,950 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:52,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133055724] [2021-08-25 20:32:52,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133055724] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:52,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:52,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:52,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776317524] [2021-08-25 20:32:52,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:52,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:52,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:52,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:52,951 INFO L87 Difference]: Start difference. First operand 383 states and 610 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:55,555 INFO L93 Difference]: Finished difference Result 835 states and 1315 transitions. [2021-08-25 20:32:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:55,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 99 [2021-08-25 20:32:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:55,557 INFO L225 Difference]: With dead ends: 835 [2021-08-25 20:32:55,557 INFO L226 Difference]: Without dead ends: 471 [2021-08-25 20:32:55,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 40.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-08-25 20:32:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 383. [2021-08-25 20:32:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5759162303664922) internal successors, (602), 382 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 602 transitions. [2021-08-25 20:32:55,566 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 602 transitions. Word has length 99 [2021-08-25 20:32:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:55,567 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 602 transitions. [2021-08-25 20:32:55,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 602 transitions. [2021-08-25 20:32:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:32:55,568 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:55,568 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:55,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-08-25 20:32:55,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:32:55,781 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash 246835400, now seen corresponding path program 1 times [2021-08-25 20:32:55,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:55,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041971612] [2021-08-25 20:32:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:55,782 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:55,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:55,783 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-08-25 20:32:55,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-25 20:32:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:32:56,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:32:56,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:32:56,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:32:56,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:32:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:56,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:32:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:32:57,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:32:57,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041971612] [2021-08-25 20:32:57,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041971612] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:32:57,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:32:57,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:32:57,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678543752] [2021-08-25 20:32:57,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:32:57,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:32:57,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:32:57,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:32:57,227 INFO L87 Difference]: Start difference. First operand 383 states and 602 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:32:59,711 INFO L93 Difference]: Finished difference Result 907 states and 1408 transitions. [2021-08-25 20:32:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:32:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 99 [2021-08-25 20:32:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:32:59,714 INFO L225 Difference]: With dead ends: 907 [2021-08-25 20:32:59,714 INFO L226 Difference]: Without dead ends: 539 [2021-08-25 20:32:59,714 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:32:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-08-25 20:32:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2021-08-25 20:32:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5755208333333333) internal successors, (605), 384 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 605 transitions. [2021-08-25 20:32:59,723 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 605 transitions. Word has length 99 [2021-08-25 20:32:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:32:59,723 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 605 transitions. [2021-08-25 20:32:59,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:32:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 605 transitions. [2021-08-25 20:32:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:32:59,725 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:32:59,725 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:32:59,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-25 20:32:59,936 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-08-25 20:32:59,936 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:32:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:32:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 919384802, now seen corresponding path program 1 times [2021-08-25 20:32:59,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:32:59,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25942347] [2021-08-25 20:32:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:32:59,938 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:32:59,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:32:59,938 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-08-25 20:32:59,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-25 20:33:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:00,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:33:00,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:00,854 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:33:00,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-08-25 20:33:00,891 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:33:00,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:33:00,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:33:01,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-25 20:33:01,487 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:01,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25942347] [2021-08-25 20:33:01,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25942347] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:01,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:01,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:01,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824283122] [2021-08-25 20:33:01,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:01,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:01,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:01,489 INFO L87 Difference]: Start difference. First operand 385 states and 605 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-08-25 20:33:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:03,258 INFO L93 Difference]: Finished difference Result 815 states and 1273 transitions. [2021-08-25 20:33:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:03,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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) Word has length 100 [2021-08-25 20:33:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:03,261 INFO L225 Difference]: With dead ends: 815 [2021-08-25 20:33:03,261 INFO L226 Difference]: Without dead ends: 449 [2021-08-25 20:33:03,262 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-08-25 20:33:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 385. [2021-08-25 20:33:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5546875) internal successors, (597), 384 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 597 transitions. [2021-08-25 20:33:03,270 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 597 transitions. Word has length 100 [2021-08-25 20:33:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:03,270 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 597 transitions. [2021-08-25 20:33:03,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-08-25 20:33:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 597 transitions. [2021-08-25 20:33:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-25 20:33:03,271 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:03,271 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:33:03,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-08-25 20:33:03,484 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-08-25 20:33:03,484 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2031824588, now seen corresponding path program 1 times [2021-08-25 20:33:03,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:03,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562102350] [2021-08-25 20:33:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:03,485 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:03,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:03,486 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-08-25 20:33:03,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-25 20:33:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:04,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:04,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:04,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:04,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:04,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:04,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:04,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562102350] [2021-08-25 20:33:04,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562102350] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:04,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:04,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:04,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832761997] [2021-08-25 20:33:04,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:04,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:04,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:04,929 INFO L87 Difference]: Start difference. First operand 385 states and 597 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:08,771 INFO L93 Difference]: Finished difference Result 927 states and 1428 transitions. [2021-08-25 20:33:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-25 20:33:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:08,773 INFO L225 Difference]: With dead ends: 927 [2021-08-25 20:33:08,773 INFO L226 Difference]: Without dead ends: 561 [2021-08-25 20:33:08,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-08-25 20:33:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 415. [2021-08-25 20:33:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5434782608695652) internal successors, (639), 414 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 639 transitions. [2021-08-25 20:33:08,783 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 639 transitions. Word has length 111 [2021-08-25 20:33:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:08,783 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 639 transitions. [2021-08-25 20:33:08,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 639 transitions. [2021-08-25 20:33:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:33:08,785 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:08,785 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08-25 20:33:08,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-08-25 20:33:08,997 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-08-25 20:33:08,998 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash -386107957, now seen corresponding path program 1 times [2021-08-25 20:33:08,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:08,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556971594] [2021-08-25 20:33:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:08,999 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:08,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:09,000 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-08-25 20:33:09,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-25 20:33:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:09,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:09,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:09,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:10,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:10,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:10,494 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:10,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556971594] [2021-08-25 20:33:10,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556971594] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:10,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:10,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:10,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755123694] [2021-08-25 20:33:10,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:10,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:10,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:10,495 INFO L87 Difference]: Start difference. First operand 415 states and 639 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:12,938 INFO L93 Difference]: Finished difference Result 943 states and 1443 transitions. [2021-08-25 20:33:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:12,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 112 [2021-08-25 20:33:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:12,942 INFO L225 Difference]: With dead ends: 943 [2021-08-25 20:33:12,942 INFO L226 Difference]: Without dead ends: 547 [2021-08-25 20:33:12,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-08-25 20:33:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 415. [2021-08-25 20:33:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5289855072463767) internal successors, (633), 414 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 633 transitions. [2021-08-25 20:33:12,952 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 633 transitions. Word has length 112 [2021-08-25 20:33:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:12,952 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 633 transitions. [2021-08-25 20:33:12,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 633 transitions. [2021-08-25 20:33:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-25 20:33:12,954 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:12,954 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:33:12,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-25 20:33:13,167 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-08-25 20:33:13,167 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash -941757422, now seen corresponding path program 1 times [2021-08-25 20:33:13,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:13,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789189655] [2021-08-25 20:33:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:13,168 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:13,169 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-08-25 20:33:13,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-25 20:33:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:14,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:14,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:14,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:14,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:14,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:14,880 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:14,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789189655] [2021-08-25 20:33:14,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789189655] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:14,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:14,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:14,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842022372] [2021-08-25 20:33:14,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:14,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:14,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:14,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:14,881 INFO L87 Difference]: Start difference. First operand 415 states and 633 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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-08-25 20:33:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:17,799 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2021-08-25 20:33:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:17,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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 114 [2021-08-25 20:33:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:17,801 INFO L225 Difference]: With dead ends: 985 [2021-08-25 20:33:17,801 INFO L226 Difference]: Without dead ends: 589 [2021-08-25 20:33:17,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-08-25 20:33:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 443. [2021-08-25 20:33:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.5158371040723981) internal successors, (670), 442 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 670 transitions. [2021-08-25 20:33:17,812 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 670 transitions. Word has length 114 [2021-08-25 20:33:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:17,812 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 670 transitions. [2021-08-25 20:33:17,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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-08-25 20:33:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 670 transitions. [2021-08-25 20:33:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:33:17,813 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:17,814 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:33:17,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-08-25 20:33:18,026 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-08-25 20:33:18,026 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1988583611, now seen corresponding path program 1 times [2021-08-25 20:33:18,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:18,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240107682] [2021-08-25 20:33:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:18,027 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:18,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:18,028 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-08-25 20:33:18,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-25 20:33:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:19,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:19,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:19,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:19,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:19,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:33:19,729 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:19,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240107682] [2021-08-25 20:33:19,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240107682] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:19,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:19,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:19,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916257006] [2021-08-25 20:33:19,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:19,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:19,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:19,731 INFO L87 Difference]: Start difference. First operand 443 states and 670 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:22,293 INFO L93 Difference]: Finished difference Result 991 states and 1490 transitions. [2021-08-25 20:33:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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 115 [2021-08-25 20:33:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:22,296 INFO L225 Difference]: With dead ends: 991 [2021-08-25 20:33:22,296 INFO L226 Difference]: Without dead ends: 567 [2021-08-25 20:33:22,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-08-25 20:33:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 443. [2021-08-25 20:33:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.5) internal successors, (663), 442 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 663 transitions. [2021-08-25 20:33:22,306 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 663 transitions. Word has length 115 [2021-08-25 20:33:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:22,307 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 663 transitions. [2021-08-25 20:33:22,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 663 transitions. [2021-08-25 20:33:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:33:22,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:22,308 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-25 20:33:22,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-25 20:33:22,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:22,521 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -538338461, now seen corresponding path program 1 times [2021-08-25 20:33:22,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:22,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296994054] [2021-08-25 20:33:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:22,522 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:22,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:22,523 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:22,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-25 20:33:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:23,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:23,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:23,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:23,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:33:23,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:33:24,309 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:24,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296994054] [2021-08-25 20:33:24,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296994054] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:24,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:24,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:24,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396095620] [2021-08-25 20:33:24,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:24,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:24,311 INFO L87 Difference]: Start difference. First operand 443 states and 663 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:27,749 INFO L93 Difference]: Finished difference Result 1033 states and 1537 transitions. [2021-08-25 20:33:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:27,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2021-08-25 20:33:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:27,751 INFO L225 Difference]: With dead ends: 1033 [2021-08-25 20:33:27,751 INFO L226 Difference]: Without dead ends: 609 [2021-08-25 20:33:27,752 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2021-08-25 20:33:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 478. [2021-08-25 20:33:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.4926624737945493) internal successors, (712), 477 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 712 transitions. [2021-08-25 20:33:27,762 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 712 transitions. Word has length 121 [2021-08-25 20:33:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:27,762 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 712 transitions. [2021-08-25 20:33:27,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 712 transitions. [2021-08-25 20:33:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:33:27,763 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:27,764 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:33:27,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-25 20:33:27,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:27,976 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2026395157, now seen corresponding path program 1 times [2021-08-25 20:33:27,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:27,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164930169] [2021-08-25 20:33:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:27,977 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:27,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:27,978 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:27,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-25 20:33:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:29,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:29,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:29,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:29,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:33:29,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:33:29,882 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:29,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164930169] [2021-08-25 20:33:29,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164930169] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:29,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:29,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:29,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135322797] [2021-08-25 20:33:29,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:29,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:29,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:29,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:29,884 INFO L87 Difference]: Start difference. First operand 478 states and 712 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:32,299 INFO L93 Difference]: Finished difference Result 1059 states and 1570 transitions. [2021-08-25 20:33:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:32,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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 122 [2021-08-25 20:33:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:32,301 INFO L225 Difference]: With dead ends: 1059 [2021-08-25 20:33:32,301 INFO L226 Difference]: Without dead ends: 600 [2021-08-25 20:33:32,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-08-25 20:33:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 478. [2021-08-25 20:33:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.4842767295597483) internal successors, (708), 477 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 708 transitions. [2021-08-25 20:33:32,321 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 708 transitions. Word has length 122 [2021-08-25 20:33:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:32,321 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 708 transitions. [2021-08-25 20:33:32,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 708 transitions. [2021-08-25 20:33:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-25 20:33:32,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:32,323 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08-25 20:33:32,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-25 20:33:32,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:32,536 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash 297188694, now seen corresponding path program 1 times [2021-08-25 20:33:32,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:32,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083416] [2021-08-25 20:33:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:32,537 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:32,538 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:32,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-25 20:33:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:33,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:33,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:33,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:34,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:33:34,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:33:34,603 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:34,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083416] [2021-08-25 20:33:34,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083416] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:34,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:34,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:34,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066216901] [2021-08-25 20:33:34,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:34,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:34,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:34,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:34,604 INFO L87 Difference]: Start difference. First operand 478 states and 708 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:36,996 INFO L93 Difference]: Finished difference Result 1102 states and 1622 transitions. [2021-08-25 20:33:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 139 [2021-08-25 20:33:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:36,998 INFO L225 Difference]: With dead ends: 1102 [2021-08-25 20:33:36,998 INFO L226 Difference]: Without dead ends: 643 [2021-08-25 20:33:36,999 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-08-25 20:33:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 521. [2021-08-25 20:33:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.475) internal successors, (767), 520 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 767 transitions. [2021-08-25 20:33:37,011 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 767 transitions. Word has length 139 [2021-08-25 20:33:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:37,011 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 767 transitions. [2021-08-25 20:33:37,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 767 transitions. [2021-08-25 20:33:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-08-25 20:33:37,013 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:37,013 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:33:37,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-08-25 20:33:37,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:37,244 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash 785633704, now seen corresponding path program 1 times [2021-08-25 20:33:37,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:37,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942084658] [2021-08-25 20:33:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:37,246 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:37,247 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:37,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-25 20:33:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:38,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:38,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:38,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:38,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:33:39,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:33:39,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:39,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942084658] [2021-08-25 20:33:39,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942084658] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:39,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:39,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:39,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217574565] [2021-08-25 20:33:39,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:39,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:39,388 INFO L87 Difference]: Start difference. First operand 521 states and 767 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:42,302 INFO L93 Difference]: Finished difference Result 1143 states and 1676 transitions. [2021-08-25 20:33:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:42,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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 140 [2021-08-25 20:33:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:42,304 INFO L225 Difference]: With dead ends: 1143 [2021-08-25 20:33:42,305 INFO L226 Difference]: Without dead ends: 625 [2021-08-25 20:33:42,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-08-25 20:33:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 513. [2021-08-25 20:33:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.470703125) internal successors, (753), 512 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 753 transitions. [2021-08-25 20:33:42,330 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 753 transitions. Word has length 140 [2021-08-25 20:33:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:42,330 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 753 transitions. [2021-08-25 20:33:42,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 753 transitions. [2021-08-25 20:33:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-08-25 20:33:42,332 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:42,332 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:33:42,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-25 20:33:42,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:42,541 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:42,541 INFO L82 PathProgramCache]: Analyzing trace with hash 713545668, now seen corresponding path program 1 times [2021-08-25 20:33:42,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:42,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951863685] [2021-08-25 20:33:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:42,542 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:42,543 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:42,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-25 20:33:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:43,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:43,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:44,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:44,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:33:44,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:33:44,697 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:44,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951863685] [2021-08-25 20:33:44,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951863685] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:44,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:44,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:44,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924071834] [2021-08-25 20:33:44,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:44,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:44,699 INFO L87 Difference]: Start difference. First operand 513 states and 753 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 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-08-25 20:33:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:47,693 INFO L93 Difference]: Finished difference Result 1153 states and 1689 transitions. [2021-08-25 20:33:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:47,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 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) Word has length 142 [2021-08-25 20:33:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:47,696 INFO L225 Difference]: With dead ends: 1153 [2021-08-25 20:33:47,696 INFO L226 Difference]: Without dead ends: 659 [2021-08-25 20:33:47,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-08-25 20:33:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 539. [2021-08-25 20:33:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4553903345724908) internal successors, (783), 538 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 783 transitions. [2021-08-25 20:33:47,714 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 783 transitions. Word has length 142 [2021-08-25 20:33:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:47,714 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 783 transitions. [2021-08-25 20:33:47,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 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-08-25 20:33:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 783 transitions. [2021-08-25 20:33:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-08-25 20:33:47,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:47,716 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:33:47,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-08-25 20:33:47,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:47,946 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash -266190451, now seen corresponding path program 1 times [2021-08-25 20:33:47,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:47,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702783835] [2021-08-25 20:33:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:47,947 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:47,948 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:47,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-08-25 20:33:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:49,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:49,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:49,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:49,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:33:49,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-08-25 20:33:50,243 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:50,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702783835] [2021-08-25 20:33:50,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702783835] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:50,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:50,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:50,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169067342] [2021-08-25 20:33:50,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:50,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:50,246 INFO L87 Difference]: Start difference. First operand 539 states and 783 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:52,778 INFO L93 Difference]: Finished difference Result 1169 states and 1695 transitions. [2021-08-25 20:33:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:52,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 143 [2021-08-25 20:33:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:52,780 INFO L225 Difference]: With dead ends: 1169 [2021-08-25 20:33:52,780 INFO L226 Difference]: Without dead ends: 649 [2021-08-25 20:33:52,781 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-08-25 20:33:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 539. [2021-08-25 20:33:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.436802973977695) internal successors, (773), 538 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 773 transitions. [2021-08-25 20:33:52,792 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 773 transitions. Word has length 143 [2021-08-25 20:33:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:52,792 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 773 transitions. [2021-08-25 20:33:52,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 773 transitions. [2021-08-25 20:33:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-25 20:33:52,794 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:52,794 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:33:52,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-08-25 20:33:53,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:53,009 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:53,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash 333012812, now seen corresponding path program 1 times [2021-08-25 20:33:53,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:53,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883764966] [2021-08-25 20:33:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:53,010 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:53,010 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:53,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-08-25 20:33:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:54,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:54,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:54,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:33:54,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:33:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:33:54,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:33:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:33:55,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:33:55,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883764966] [2021-08-25 20:33:55,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883764966] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:33:55,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:33:55,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:33:55,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918509603] [2021-08-25 20:33:55,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:33:55,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:33:55,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:33:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:33:55,349 INFO L87 Difference]: Start difference. First operand 539 states and 773 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:33:58,048 INFO L93 Difference]: Finished difference Result 1203 states and 1723 transitions. [2021-08-25 20:33:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:33:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-08-25 20:33:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:33:58,051 INFO L225 Difference]: With dead ends: 1203 [2021-08-25 20:33:58,051 INFO L226 Difference]: Without dead ends: 683 [2021-08-25 20:33:58,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:33:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-08-25 20:33:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 572. [2021-08-25 20:33:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4273204903677759) internal successors, (815), 571 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 815 transitions. [2021-08-25 20:33:58,064 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 815 transitions. Word has length 153 [2021-08-25 20:33:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:33:58,064 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 815 transitions. [2021-08-25 20:33:58,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:33:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 815 transitions. [2021-08-25 20:33:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-08-25 20:33:58,066 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:33:58,066 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:33:58,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-08-25 20:33:58,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:33:58,281 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:33:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:33:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1889886562, now seen corresponding path program 1 times [2021-08-25 20:33:58,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:33:58,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572602218] [2021-08-25 20:33:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:33:58,282 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:33:58,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:33:58,283 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:33:58,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-08-25 20:33:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:33:59,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:33:59,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:33:59,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:34:00,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:34:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:34:00,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:34:00,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:00,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572602218] [2021-08-25 20:34:00,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572602218] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:00,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:00,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:34:00,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043936401] [2021-08-25 20:34:00,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:34:00,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:34:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:34:00,747 INFO L87 Difference]: Start difference. First operand 572 states and 815 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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-08-25 20:34:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:03,143 INFO L93 Difference]: Finished difference Result 1231 states and 1752 transitions. [2021-08-25 20:34:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:34:03,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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) Word has length 154 [2021-08-25 20:34:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:03,146 INFO L225 Difference]: With dead ends: 1231 [2021-08-25 20:34:03,147 INFO L226 Difference]: Without dead ends: 660 [2021-08-25 20:34:03,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:34:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-08-25 20:34:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 563. [2021-08-25 20:34:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.414590747330961) internal successors, (795), 562 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 795 transitions. [2021-08-25 20:34:03,180 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 795 transitions. Word has length 154 [2021-08-25 20:34:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:03,180 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 795 transitions. [2021-08-25 20:34:03,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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-08-25 20:34:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 795 transitions. [2021-08-25 20:34:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:34:03,181 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:03,181 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:03,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:03,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:03,382 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1254627333, now seen corresponding path program 1 times [2021-08-25 20:34:03,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:03,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395044782] [2021-08-25 20:34:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:03,383 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:03,384 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:03,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-08-25 20:34:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:05,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:34:05,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:05,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:34:05,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:34:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:34:05,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:34:05,892 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:05,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395044782] [2021-08-25 20:34:05,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395044782] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:05,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:05,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:34:05,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903665208] [2021-08-25 20:34:05,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:34:05,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:05,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:34:05,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:34:05,893 INFO L87 Difference]: Start difference. First operand 563 states and 795 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:08,841 INFO L93 Difference]: Finished difference Result 1229 states and 1739 transitions. [2021-08-25 20:34:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:34:08,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-08-25 20:34:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:08,844 INFO L225 Difference]: With dead ends: 1229 [2021-08-25 20:34:08,844 INFO L226 Difference]: Without dead ends: 685 [2021-08-25 20:34:08,846 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:34:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-08-25 20:34:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 585. [2021-08-25 20:34:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.3955479452054795) internal successors, (815), 584 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 815 transitions. [2021-08-25 20:34:08,856 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 815 transitions. Word has length 161 [2021-08-25 20:34:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:08,856 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 815 transitions. [2021-08-25 20:34:08,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 815 transitions. [2021-08-25 20:34:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-08-25 20:34:08,858 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:08,858 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:08,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:09,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:09,059 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:09,059 INFO L82 PathProgramCache]: Analyzing trace with hash 539092562, now seen corresponding path program 1 times [2021-08-25 20:34:09,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:09,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634579530] [2021-08-25 20:34:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:09,060 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:09,060 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:09,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-08-25 20:34:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:10,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:34:10,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:10,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:34:11,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:34:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:34:11,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:34:11,760 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:11,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634579530] [2021-08-25 20:34:11,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634579530] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:11,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:11,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:34:11,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125970344] [2021-08-25 20:34:11,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:34:11,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:11,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:34:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:34:11,761 INFO L87 Difference]: Start difference. First operand 585 states and 815 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:14,587 INFO L93 Difference]: Finished difference Result 1244 states and 1735 transitions. [2021-08-25 20:34:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:34:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 162 [2021-08-25 20:34:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:14,590 INFO L225 Difference]: With dead ends: 1244 [2021-08-25 20:34:14,590 INFO L226 Difference]: Without dead ends: 678 [2021-08-25 20:34:14,591 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:34:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-08-25 20:34:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 585. [2021-08-25 20:34:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.375) internal successors, (803), 584 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 803 transitions. [2021-08-25 20:34:14,601 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 803 transitions. Word has length 162 [2021-08-25 20:34:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:14,601 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 803 transitions. [2021-08-25 20:34:14,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 803 transitions. [2021-08-25 20:34:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:34:14,603 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:14,603 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:14,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:14,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:14,817 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1607603189, now seen corresponding path program 1 times [2021-08-25 20:34:14,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:14,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825752579] [2021-08-25 20:34:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:14,818 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:14,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:14,819 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:14,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-08-25 20:34:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:16,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:34:16,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:16,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:34:16,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:34:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:34:17,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:34:17,631 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:17,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825752579] [2021-08-25 20:34:17,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825752579] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:17,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:17,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:34:17,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674521224] [2021-08-25 20:34:17,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:34:17,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:17,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:34:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:34:17,633 INFO L87 Difference]: Start difference. First operand 585 states and 803 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 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-08-25 20:34:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:20,270 INFO L93 Difference]: Finished difference Result 1269 states and 1745 transitions. [2021-08-25 20:34:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:34:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 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) Word has length 164 [2021-08-25 20:34:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:20,274 INFO L225 Difference]: With dead ends: 1269 [2021-08-25 20:34:20,274 INFO L226 Difference]: Without dead ends: 703 [2021-08-25 20:34:20,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:34:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-08-25 20:34:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 609. [2021-08-25 20:34:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 1.356907894736842) internal successors, (825), 608 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 825 transitions. [2021-08-25 20:34:20,285 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 825 transitions. Word has length 164 [2021-08-25 20:34:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:20,285 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 825 transitions. [2021-08-25 20:34:20,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 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-08-25 20:34:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 825 transitions. [2021-08-25 20:34:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-25 20:34:20,286 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:20,286 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:20,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:20,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:20,491 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2130185036, now seen corresponding path program 1 times [2021-08-25 20:34:20,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:20,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492687840] [2021-08-25 20:34:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:20,492 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:20,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:20,493 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:20,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-08-25 20:34:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:22,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:34:22,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-08-25 20:34:22,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-08-25 20:34:23,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:23,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492687840] [2021-08-25 20:34:23,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492687840] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:23,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:23,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:34:23,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751264685] [2021-08-25 20:34:23,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:34:23,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:34:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:23,309 INFO L87 Difference]: Start difference. First operand 609 states and 825 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:23,596 INFO L93 Difference]: Finished difference Result 1783 states and 2423 transitions. [2021-08-25 20:34:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:34:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 164 [2021-08-25 20:34:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:23,600 INFO L225 Difference]: With dead ends: 1783 [2021-08-25 20:34:23,600 INFO L226 Difference]: Without dead ends: 1193 [2021-08-25 20:34:23,601 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2021-08-25 20:34:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2021-08-25 20:34:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 1.354026845637584) internal successors, (1614), 1192 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1614 transitions. [2021-08-25 20:34:23,625 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1614 transitions. Word has length 164 [2021-08-25 20:34:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:23,625 INFO L470 AbstractCegarLoop]: Abstraction has 1193 states and 1614 transitions. [2021-08-25 20:34:23,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1614 transitions. [2021-08-25 20:34:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 20:34:23,626 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:23,626 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:23,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:23,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:23,831 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1876567476, now seen corresponding path program 1 times [2021-08-25 20:34:23,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:23,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179086347] [2021-08-25 20:34:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:23,833 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:23,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:23,834 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:23,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-08-25 20:34:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:26,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:34:26,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:26,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:34:26,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:34:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:34:26,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:34:26,788 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:26,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179086347] [2021-08-25 20:34:26,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179086347] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:26,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:26,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:34:26,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798846554] [2021-08-25 20:34:26,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:34:26,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:34:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:34:26,789 INFO L87 Difference]: Start difference. First operand 1193 states and 1614 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:29,192 INFO L93 Difference]: Finished difference Result 2541 states and 3437 transitions. [2021-08-25 20:34:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:34:29,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 165 [2021-08-25 20:34:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:29,197 INFO L225 Difference]: With dead ends: 2541 [2021-08-25 20:34:29,197 INFO L226 Difference]: Without dead ends: 1351 [2021-08-25 20:34:29,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:34:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-08-25 20:34:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1185. [2021-08-25 20:34:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.3327702702702702) internal successors, (1578), 1184 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1578 transitions. [2021-08-25 20:34:29,229 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1578 transitions. Word has length 165 [2021-08-25 20:34:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:29,229 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 1578 transitions. [2021-08-25 20:34:29,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1578 transitions. [2021-08-25 20:34:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 20:34:29,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:29,230 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:29,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:29,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:29,431 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1370865435, now seen corresponding path program 1 times [2021-08-25 20:34:29,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:29,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397086280] [2021-08-25 20:34:29,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:29,432 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:29,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:29,433 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:29,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-08-25 20:34:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:31,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:34:31,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:34:32,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:34:32,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:32,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397086280] [2021-08-25 20:34:32,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397086280] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:32,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:32,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:34:32,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509578289] [2021-08-25 20:34:32,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:34:32,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:32,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:34:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:32,414 INFO L87 Difference]: Start difference. First operand 1185 states and 1578 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:32,667 INFO L93 Difference]: Finished difference Result 2896 states and 3863 transitions. [2021-08-25 20:34:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:34:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 165 [2021-08-25 20:34:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:32,672 INFO L225 Difference]: With dead ends: 2896 [2021-08-25 20:34:32,672 INFO L226 Difference]: Without dead ends: 1730 [2021-08-25 20:34:32,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2021-08-25 20:34:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1728. [2021-08-25 20:34:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.3323682686740013) internal successors, (2301), 1727 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2301 transitions. [2021-08-25 20:34:32,740 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2301 transitions. Word has length 165 [2021-08-25 20:34:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:32,740 INFO L470 AbstractCegarLoop]: Abstraction has 1728 states and 2301 transitions. [2021-08-25 20:34:32,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2301 transitions. [2021-08-25 20:34:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:34:32,742 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:32,742 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:32,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:32,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:32,961 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash -730951185, now seen corresponding path program 1 times [2021-08-25 20:34:32,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:32,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449175296] [2021-08-25 20:34:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:32,962 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:32,964 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:32,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-08-25 20:34:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:35,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:34:35,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-25 20:34:35,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-25 20:34:36,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:36,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449175296] [2021-08-25 20:34:36,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449175296] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:36,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:36,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:34:36,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892910730] [2021-08-25 20:34:36,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:34:36,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:34:36,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:36,082 INFO L87 Difference]: Start difference. First operand 1728 states and 2301 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:36,305 INFO L93 Difference]: Finished difference Result 3973 states and 5302 transitions. [2021-08-25 20:34:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:34:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 166 [2021-08-25 20:34:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:36,310 INFO L225 Difference]: With dead ends: 3973 [2021-08-25 20:34:36,310 INFO L226 Difference]: Without dead ends: 2264 [2021-08-25 20:34:36,311 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2021-08-25 20:34:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2242. [2021-08-25 20:34:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 1.3373493975903614) internal successors, (2997), 2241 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2997 transitions. [2021-08-25 20:34:36,359 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2997 transitions. Word has length 166 [2021-08-25 20:34:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:36,359 INFO L470 AbstractCegarLoop]: Abstraction has 2242 states and 2997 transitions. [2021-08-25 20:34:36,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2997 transitions. [2021-08-25 20:34:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:34:36,360 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:36,361 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:36,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:36,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:36,561 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1165456783, now seen corresponding path program 1 times [2021-08-25 20:34:36,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:36,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942530182] [2021-08-25 20:34:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:36,563 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:36,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:36,563 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:36,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-08-25 20:34:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:38,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:34:38,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:34:39,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 20:34:39,696 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:39,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942530182] [2021-08-25 20:34:39,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942530182] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:39,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:39,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:34:39,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937922954] [2021-08-25 20:34:39,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:34:39,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:39,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:34:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:39,697 INFO L87 Difference]: Start difference. First operand 2242 states and 2997 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:39,980 INFO L93 Difference]: Finished difference Result 4514 states and 6039 transitions. [2021-08-25 20:34:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:34:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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) Word has length 166 [2021-08-25 20:34:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:39,987 INFO L225 Difference]: With dead ends: 4514 [2021-08-25 20:34:39,987 INFO L226 Difference]: Without dead ends: 2291 [2021-08-25 20:34:39,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2021-08-25 20:34:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2021-08-25 20:34:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 2290 states have (on average 1.3375545851528385) internal successors, (3063), 2290 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3063 transitions. [2021-08-25 20:34:40,029 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3063 transitions. Word has length 166 [2021-08-25 20:34:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:40,029 INFO L470 AbstractCegarLoop]: Abstraction has 2291 states and 3063 transitions. [2021-08-25 20:34:40,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3063 transitions. [2021-08-25 20:34:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-08-25 20:34:40,032 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:40,032 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:40,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-08-25 20:34:40,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:40,248 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash 765668851, now seen corresponding path program 1 times [2021-08-25 20:34:40,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:40,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947972022] [2021-08-25 20:34:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:40,249 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:40,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:40,250 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:40,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-08-25 20:34:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:42,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:34:42,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-08-25 20:34:43,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-08-25 20:34:43,522 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:43,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947972022] [2021-08-25 20:34:43,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947972022] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:34:43,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:34:43,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:34:43,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717539418] [2021-08-25 20:34:43,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:34:43,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:34:43,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:43,524 INFO L87 Difference]: Start difference. First operand 2291 states and 3063 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:34:43,595 INFO L93 Difference]: Finished difference Result 4587 states and 6136 transitions. [2021-08-25 20:34:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:34:43,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 166 [2021-08-25 20:34:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:34:43,601 INFO L225 Difference]: With dead ends: 4587 [2021-08-25 20:34:43,601 INFO L226 Difference]: Without dead ends: 2315 [2021-08-25 20:34:43,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:34:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2021-08-25 20:34:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2315. [2021-08-25 20:34:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2314 states have (on average 1.3375108038029386) internal successors, (3095), 2314 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3095 transitions. [2021-08-25 20:34:43,647 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3095 transitions. Word has length 166 [2021-08-25 20:34:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:34:43,648 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 3095 transitions. [2021-08-25 20:34:43,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:34:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3095 transitions. [2021-08-25 20:34:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-08-25 20:34:43,649 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:34:43,650 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:34:43,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2021-08-25 20:34:43,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:34:43,851 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:34:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:34:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1394677973, now seen corresponding path program 1 times [2021-08-25 20:34:43,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:34:43,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631850918] [2021-08-25 20:34:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:34:43,852 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:34:43,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:34:43,852 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:34:43,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-08-25 20:34:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:34:46,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-25 20:34:46,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:34:46,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:46,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:46,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2021-08-25 20:34:46,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:46,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:46,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:46,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-08-25 20:34:46,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2021-08-25 20:34:46,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:46,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:34:47,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:34:47,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:34:47,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:34:47,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:34:47,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:34:47,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:34:47,569 INFO L354 Elim1Store]: treesize reduction 119, result has 8.5 percent of original size [2021-08-25 20:34:47,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 45 [2021-08-25 20:34:47,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:47,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:34:47,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:34:47,932 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:34:47,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:34:47,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:48,526 INFO L354 Elim1Store]: treesize reduction 128, result has 19.5 percent of original size [2021-08-25 20:34:48,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 292 treesize of output 222 [2021-08-25 20:34:48,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 232 [2021-08-25 20:34:48,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:48,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:34:48,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:48,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 175 [2021-08-25 20:34:48,672 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:34:48,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 165 [2021-08-25 20:34:48,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:48,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2021-08-25 20:34:48,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 144 [2021-08-25 20:34:48,705 INFO L354 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2021-08-25 20:34:48,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 110 [2021-08-25 20:34:48,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:48,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:48,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2021-08-25 20:34:48,726 INFO L354 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2021-08-25 20:34:48,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 87 [2021-08-25 20:34:48,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:48,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2021-08-25 20:34:48,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-08-25 20:34:49,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2021-08-25 20:34:49,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2021-08-25 20:34:49,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:34:49,471 INFO L354 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2021-08-25 20:34:49,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 41 [2021-08-25 20:34:50,450 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-08-25 20:34:50,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 17 [2021-08-25 20:34:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:34:50,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:34:50,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2194 treesize of output 2050 [2021-08-25 20:34:50,926 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:34:50,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 4297 treesize of output 3346 [2021-08-25 20:34:51,086 INFO L354 Elim1Store]: treesize reduction 68, result has 37.0 percent of original size [2021-08-25 20:34:51,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3346 treesize of output 1661 [2021-08-25 20:34:51,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1653 treesize of output 1567 [2021-08-25 20:34:51,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16743 treesize of output 15319 [2021-08-25 20:34:52,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2021-08-25 20:34:52,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2021-08-25 20:34:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:34:53,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:34:53,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631850918] [2021-08-25 20:34:53,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631850918] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:34:53,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:34:53,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-25 20:34:53,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205439969] [2021-08-25 20:34:53,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 20:34:53,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:34:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 20:34:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:34:53,436 INFO L87 Difference]: Start difference. First operand 2315 states and 3095 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:35:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:35:54,648 INFO L93 Difference]: Finished difference Result 5721 states and 7671 transitions. [2021-08-25 20:35:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-25 20:35:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 0 states have call successors, (0), 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 189 [2021-08-25 20:35:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:35:54,655 INFO L225 Difference]: With dead ends: 5721 [2021-08-25 20:35:54,655 INFO L226 Difference]: Without dead ends: 3449 [2021-08-25 20:35:54,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 360 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 436.6ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-08-25 20:35:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2021-08-25 20:35:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 2894. [2021-08-25 20:35:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2893 states have (on average 1.3484272381610785) internal successors, (3901), 2893 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:35:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3901 transitions. [2021-08-25 20:35:54,767 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3901 transitions. Word has length 189 [2021-08-25 20:35:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:35:54,768 INFO L470 AbstractCegarLoop]: Abstraction has 2894 states and 3901 transitions. [2021-08-25 20:35:54,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:35:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3901 transitions. [2021-08-25 20:35:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-08-25 20:35:54,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:35:54,772 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:35:54,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-08-25 20:35:54,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:35:54,990 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:35:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:35:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1609124134, now seen corresponding path program 1 times [2021-08-25 20:35:54,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:35:54,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871331860] [2021-08-25 20:35:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:35:54,991 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:35:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:35:54,992 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:35:54,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-08-25 20:35:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:35:58,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-25 20:35:58,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:35:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2021-08-25 20:35:58,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-08-25 20:35:58,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-08-25 20:35:58,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:35:58,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:35:58,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:35:58,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:35:58,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:35:58,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:58,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:35:59,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:35:59,034 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:35:59,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:35:59,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:35:59,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:35:59,417 INFO L354 Elim1Store]: treesize reduction 119, result has 8.5 percent of original size [2021-08-25 20:35:59,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 45 [2021-08-25 20:35:59,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,794 INFO L354 Elim1Store]: treesize reduction 128, result has 19.5 percent of original size [2021-08-25 20:35:59,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 292 treesize of output 222 [2021-08-25 20:35:59,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 232 [2021-08-25 20:35:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:35:59,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 175 [2021-08-25 20:35:59,930 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:35:59,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 165 [2021-08-25 20:35:59,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2021-08-25 20:35:59,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 144 [2021-08-25 20:35:59,974 INFO L354 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2021-08-25 20:35:59,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 110 [2021-08-25 20:35:59,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:35:59,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2021-08-25 20:36:00,013 INFO L354 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2021-08-25 20:36:00,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 87 [2021-08-25 20:36:00,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:00,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2021-08-25 20:36:00,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-08-25 20:36:00,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:00,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2021-08-25 20:36:00,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:00,769 INFO L354 Elim1Store]: treesize reduction 127, result has 14.2 percent of original size [2021-08-25 20:36:00,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 59 [2021-08-25 20:36:00,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2021-08-25 20:36:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 403 proven. 11 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:36:01,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:36:01,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1101 treesize of output 957 [2021-08-25 20:36:01,739 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:36:01,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 855 treesize of output 826 [2021-08-25 20:36:01,873 INFO L354 Elim1Store]: treesize reduction 57, result has 47.2 percent of original size [2021-08-25 20:36:01,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1899 treesize of output 963 [2021-08-25 20:36:01,905 INFO L354 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2021-08-25 20:36:01,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 955 treesize of output 898 [2021-08-25 20:36:01,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58012 treesize of output 55612 [2021-08-25 20:36:03,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2021-08-25 20:36:04,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2021-08-25 20:36:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 260 proven. 154 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:36:04,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:36:04,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871331860] [2021-08-25 20:36:04,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871331860] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:36:04,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:36:04,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-25 20:36:04,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443834290] [2021-08-25 20:36:04,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 20:36:04,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:36:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 20:36:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:36:04,726 INFO L87 Difference]: Start difference. First operand 2894 states and 3901 transitions. Second operand has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:36:55,770 INFO L93 Difference]: Finished difference Result 6456 states and 8681 transitions. [2021-08-25 20:36:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-25 20:36:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 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 231 [2021-08-25 20:36:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:36:55,777 INFO L225 Difference]: With dead ends: 6456 [2021-08-25 20:36:55,777 INFO L226 Difference]: Without dead ends: 3654 [2021-08-25 20:36:55,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 443 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 363.0ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-08-25 20:36:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2021-08-25 20:36:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2914. [2021-08-25 20:36:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2913 states have (on average 1.3498111912118091) internal successors, (3932), 2913 states have internal predecessors, (3932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3932 transitions. [2021-08-25 20:36:55,858 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3932 transitions. Word has length 231 [2021-08-25 20:36:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:36:55,859 INFO L470 AbstractCegarLoop]: Abstraction has 2914 states and 3932 transitions. [2021-08-25 20:36:55,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:36:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3932 transitions. [2021-08-25 20:36:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-08-25 20:36:55,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:36:55,863 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:36:55,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2021-08-25 20:36:56,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:36:56,063 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:36:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:36:56,064 INFO L82 PathProgramCache]: Analyzing trace with hash -332045037, now seen corresponding path program 1 times [2021-08-25 20:36:56,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:36:56,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623339901] [2021-08-25 20:36:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:36:56,064 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:36:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:36:56,065 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:36:56,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-08-25 20:36:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:36:59,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-25 20:36:59,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:36:59,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2021-08-25 20:36:59,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-08-25 20:36:59,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-08-25 20:36:59,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:36:59,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:36:59,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:36:59,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:37:00,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:37:00,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-08-25 20:37:00,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:37:00,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:37:00,504 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:37:00,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:37:00,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:00,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-25 20:37:00,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:37:00,761 INFO L354 Elim1Store]: treesize reduction 117, result has 10.0 percent of original size [2021-08-25 20:37:00,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2021-08-25 20:37:00,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:01,321 INFO L354 Elim1Store]: treesize reduction 128, result has 19.5 percent of original size [2021-08-25 20:37:01,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 292 treesize of output 222 [2021-08-25 20:37:01,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 232 [2021-08-25 20:37:01,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:01,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-25 20:37:01,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:01,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 175 [2021-08-25 20:37:01,408 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-25 20:37:01,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 165 [2021-08-25 20:37:01,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:01,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2021-08-25 20:37:01,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 144 [2021-08-25 20:37:01,441 INFO L354 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2021-08-25 20:37:01,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 110 [2021-08-25 20:37:01,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:01,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:01,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2021-08-25 20:37:01,465 INFO L354 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2021-08-25 20:37:01,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 87 [2021-08-25 20:37:01,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:01,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2021-08-25 20:37:01,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-08-25 20:37:02,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2021-08-25 20:37:02,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2021-08-25 20:37:02,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-25 20:37:02,158 INFO L354 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2021-08-25 20:37:02,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 41 [2021-08-25 20:37:02,490 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-08-25 20:37:02,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 17 [2021-08-25 20:37:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 353 proven. 69 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-25 20:37:02,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:37:03,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 390 [2021-08-25 20:37:03,077 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 20:37:03,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 425 treesize of output 402 [2021-08-25 20:37:03,257 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-08-25 20:37:03,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 573 treesize of output 554 [2021-08-25 20:37:12,948 WARN L207 SmtUtils]: Spent 9.69 s on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2021-08-25 20:37:12,949 INFO L354 Elim1Store]: treesize reduction 238, result has 26.8 percent of original size [2021-08-25 20:37:12,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 618 treesize of output 564 [2021-08-25 20:37:12,968 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:37:12,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623339901] [2021-08-25 20:37:12,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-08-25 20:37:12,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1055727786] [2021-08-25 20:37:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:12,969 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-25 20:37:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-25 20:37:12,971 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-25 20:37:12,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2021-08-25 20:37:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:23,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-25 20:37:23,482 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3ca25cbb [2021-08-25 20:37:23,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134510732] [2021-08-25 20:37:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:37:23,482 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:23,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:37:23,483 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:37:23,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-08-25 20:37:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:37:27,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 50 conjunts are in the unsatisfiable core [2021-08-25 20:37:27,260 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3ca25cbb [2021-08-25 20:37:27,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:37:27,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-25 20:37:27,260 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-25 20:37:27,260 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-25 20:37:27,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:37:27,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:27,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Ended with exit code 0 [2021-08-25 20:37:27,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-08-25 20:37:27,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:37:27,873 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:37:27,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:37:27 BoogieIcfgContainer [2021-08-25 20:37:27,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:37:27,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:37:27,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:37:27,942 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:37:27,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:31:57" (3/4) ... [2021-08-25 20:37:27,945 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:37:27,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:37:27,946 INFO L168 Benchmark]: Toolchain (without parser) took 332790.60 ms. Allocated memory was 52.4 MB in the beginning and 799.0 MB in the end (delta: 746.6 MB). Free memory was 27.2 MB in the beginning and 594.9 MB in the end (delta: -567.7 MB). Peak memory consumption was 178.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:27,946 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 52.4 MB. Free memory was 35.0 MB in the beginning and 35.0 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:37:27,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.55 ms. Allocated memory was 52.4 MB in the beginning and 65.0 MB in the end (delta: 12.6 MB). Free memory was 27.1 MB in the beginning and 40.0 MB in the end (delta: -12.9 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:27,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.05 ms. Allocated memory is still 65.0 MB. Free memory was 40.0 MB in the beginning and 35.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:27,947 INFO L168 Benchmark]: Boogie Preprocessor took 91.16 ms. Allocated memory is still 65.0 MB. Free memory was 35.5 MB in the beginning and 28.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:27,947 INFO L168 Benchmark]: RCFGBuilder took 1629.12 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 28.5 MB in the beginning and 60.8 MB in the end (delta: -32.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:27,948 INFO L168 Benchmark]: TraceAbstraction took 330371.77 ms. Allocated memory was 86.0 MB in the beginning and 799.0 MB in the end (delta: 713.0 MB). Free memory was 60.2 MB in the beginning and 594.9 MB in the end (delta: -534.7 MB). Peak memory consumption was 179.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:37:27,948 INFO L168 Benchmark]: Witness Printer took 3.85 ms. Allocated memory is still 799.0 MB. Free memory is still 594.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:37:27,953 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.18 ms. Allocated memory is still 52.4 MB. Free memory was 35.0 MB in the beginning and 35.0 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 605.55 ms. Allocated memory was 52.4 MB in the beginning and 65.0 MB in the end (delta: 12.6 MB). Free memory was 27.1 MB in the beginning and 40.0 MB in the end (delta: -12.9 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.05 ms. Allocated memory is still 65.0 MB. Free memory was 40.0 MB in the beginning and 35.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.16 ms. Allocated memory is still 65.0 MB. Free memory was 35.5 MB in the beginning and 28.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1629.12 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 28.5 MB in the beginning and 60.8 MB in the end (delta: -32.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 330371.77 ms. Allocated memory was 86.0 MB in the beginning and 799.0 MB in the end (delta: 713.0 MB). Free memory was 60.2 MB in the beginning and 594.9 MB in the end (delta: -534.7 MB). Peak memory consumption was 179.0 MB. Max. memory is 16.1 GB. * Witness Printer took 3.85 ms. Allocated memory is still 799.0 MB. Free memory is still 594.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1713]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) [L1132] EXPR s->cert [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 [L1349] COND FALSE !(ret <= 0) [L1354] s->hit [L1354] COND FALSE !(s->hit) [L1357] s->state = 8512 [L1359] s->init_num = 0 [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND TRUE s->state == 8512 [L1363] EXPR s->s3 [L1363] EXPR (s->s3)->tmp.new_cipher [L1363] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1363] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1364] skip = 1 [L1373] s->state = 8528 [L1374] s->init_num = 0 [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND TRUE s->state == 8528 [L1378] EXPR s->s3 [L1378] EXPR (s->s3)->tmp.new_cipher [L1378] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1378] l = ((s->s3)->tmp.new_cipher)->algorithms [L1379] EXPR s->options [L1379] COND TRUE s->options & 2097152UL [L1380] EXPR s->s3 [L1380] (s->s3)->tmp.use_rsa_tmp = 1 [L1384] EXPR s->s3 [L1384] (s->s3)->tmp.use_rsa_tmp [L1384] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1402] ret = __VERIFIER_nondet_int() [L1403] COND FALSE !(ret <= 0) [L1420] s->state = 8544 [L1421] s->init_num = 0 [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND TRUE s->state == 8544 [L1425] EXPR s->verify_mode [L1425] COND TRUE s->verify_mode & 1 [L1426] EXPR s->session [L1426] EXPR (s->session)->peer [L1426] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1436] EXPR s->s3 [L1436] EXPR (s->s3)->tmp.new_cipher [L1436] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1436] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1446] EXPR s->s3 [L1446] (s->s3)->tmp.cert_request = 1 [L1447] ret = __VERIFIER_nondet_int() [L1448] COND FALSE !(ret <= 0) [L1453] s->state = 8448 [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.next_state = 8576 [L1455] s->init_num = 0 [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND TRUE s->state == 8448 [L1477] COND FALSE !(num1 > 0L) [L1490] EXPR s->s3 [L1490] EXPR (s->s3)->tmp.next_state [L1490] s->state = (s->s3)->tmp.next_state [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND TRUE s->state == 8481 [L1308] s->shutdown = 0 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND FALSE !(ret <= 0) [L1315] EXPR s->s3 [L1315] (s->s3)->tmp.next_state = 8482 [L1316] s->state = 8448 [L1317] s->init_num = 0 [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND TRUE s->state == 8448 [L1477] COND FALSE !(num1 > 0L) [L1490] EXPR s->s3 [L1490] EXPR (s->s3)->tmp.next_state [L1490] s->state = (s->s3)->tmp.next_state [L1672] EXPR s->s3 [L1672] EXPR (s->s3)->tmp.reuse_message [L1672] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1701] skip = 0 [L1138] COND TRUE 1 [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state [L1225] COND TRUE s->state == 8640 [L1537] ret = __VERIFIER_nondet_int() [L1538] COND FALSE !(blastFlag == 4) [L1713] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 330245.9ms, OverallIterations: 40, TraceHistogramMax: 9, EmptinessCheckTime: 71.0ms, AutomataDifference: 202534.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6159 SDtfs, 7016 SDslu, 15548 SDs, 0 SdLazy, 15739 SolverSat, 2500 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 190038.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9461 GetRequests, 9216 SyntacticMatches, 26 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2053.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2914occurred in iteration=39, InterpolantAutomatonStates: 227, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 811.6ms AutomataMinimizationTime, 39 MinimizatonAttempts, 5101 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1424.9ms SsaConstructionTime, 4411.3ms SatisfiabilityAnalysisTime, 38502.5ms InterpolantComputationTime, 4732 NumberOfCodeBlocks, 4732 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9386 ConstructedInterpolants, 280 QuantifiedInterpolants, 34948 SizeOfPredicates, 132 NumberOfNonLiveVariables, 11825 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 78 InterpolantComputations, 74 PerfectInterpolantSequences, 9954/10446 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-25 20:37:28,188 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-25 20:37:28,207 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 137 Received shutdown request...