./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.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-simplified/s3_srvr_12.cil.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 8822f5291178e45ba1da62c4d4636880280d6cc4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:12:53,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:12:53,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:12:53,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:12:53,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:12:53,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:12:53,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:12:53,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:12:53,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:12:53,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:12:53,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:12:53,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:12:53,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:12:53,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:12:53,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:12:53,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:12:53,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:12:53,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:12:53,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:12:53,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:12:53,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:12:53,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:12:53,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:12:53,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:12:53,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:12:53,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:12:53,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:12:53,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:12:53,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:12:53,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:12:53,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:12:53,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:12:53,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:12:53,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:12:53,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:12:53,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:12:53,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:12:53,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:12:53,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:12:53,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:12:53,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:12:53,791 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:12:53,835 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:12:53,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:12:53,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:12:53,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:12:53,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:12:53,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:12:53,837 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:12:53,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:12:53,838 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:12:53,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:12:53,839 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:12:53,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:12:53,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:12:53,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:12:53,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:12:53,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:53,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:12:53,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:12:53,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:12:53,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:12:53,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:12:53,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:12:53,841 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:12:53,841 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 -> 8822f5291178e45ba1da62c4d4636880280d6cc4 [2021-08-25 20:12:54,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:12:54,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:12:54,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:12:54,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:12:54,225 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:12:54,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2021-08-25 20:12:54,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b036d3d/e550b832528f4d80a1f807b365ebf7ff/FLAG73049b4e3 [2021-08-25 20:12:54,720 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:12:54,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2021-08-25 20:12:54,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b036d3d/e550b832528f4d80a1f807b365ebf7ff/FLAG73049b4e3 [2021-08-25 20:12:55,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b036d3d/e550b832528f4d80a1f807b365ebf7ff [2021-08-25 20:12:55,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:12:55,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:12:55,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:55,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:12:55,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:12:55,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5d68a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55, skipping insertion in model container [2021-08-25 20:12:55,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:12:55,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:12:55,344 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-simplified/s3_srvr_12.cil.c[49194,49207] [2021-08-25 20:12:55,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:55,370 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:12:55,450 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-simplified/s3_srvr_12.cil.c[49194,49207] [2021-08-25 20:12:55,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:55,466 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:12:55,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55 WrapperNode [2021-08-25 20:12:55,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:55,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:55,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:12:55,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:12:55,475 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:12:55" (1/1) ... [2021-08-25 20:12:55,483 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:12:55" (1/1) ... [2021-08-25 20:12:55,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:55,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:12:55,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:12:55,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:12:55,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:12:55,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:12:55,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:12:55,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:12:55,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (1/1) ... [2021-08-25 20:12:55,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:55,650 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:12:55,682 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:12:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:12:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:12:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:12:55,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:12:55,819 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:12:56,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:12:56,545 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:12:56,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:12:56,557 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:12:56,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:56 BoogieIcfgContainer [2021-08-25 20:12:56,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:12:56,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:12:56,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:12:56,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:12:56,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:12:55" (1/3) ... [2021-08-25 20:12:56,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7249435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:56, skipping insertion in model container [2021-08-25 20:12:56,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:55" (2/3) ... [2021-08-25 20:12:56,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7249435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:56, skipping insertion in model container [2021-08-25 20:12:56,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:56" (3/3) ... [2021-08-25 20:12:56,566 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2021-08-25 20:12:56,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:12:56,575 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:12:56,617 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:12:56,626 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:12:56,626 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:12:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 165 states have (on average 1.7636363636363637) internal successors, (291), 166 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 20:12:56,660 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:56,662 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:56,662 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:56,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1659372905, now seen corresponding path program 1 times [2021-08-25 20:12:56,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:56,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013769029] [2021-08-25 20:12:56,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:56,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:56,903 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:12:56,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:56,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013769029] [2021-08-25 20:12:56,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013769029] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:56,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:56,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:56,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74881284] [2021-08-25 20:12:56,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:56,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:56,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:56,942 INFO L87 Difference]: Start difference. First operand has 167 states, 165 states have (on average 1.7636363636363637) internal successors, (291), 166 states have internal predecessors, (291), 0 states have call successors, (0), 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 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:57,172 INFO L93 Difference]: Finished difference Result 353 states and 613 transitions. [2021-08-25 20:12:57,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-25 20:12:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:57,186 INFO L225 Difference]: With dead ends: 353 [2021-08-25 20:12:57,187 INFO L226 Difference]: Without dead ends: 174 [2021-08-25 20:12:57,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-25 20:12:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2021-08-25 20:12:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6198830409356726) internal successors, (277), 171 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 277 transitions. [2021-08-25 20:12:57,252 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 277 transitions. Word has length 28 [2021-08-25 20:12:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:57,252 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 277 transitions. [2021-08-25 20:12:57,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 277 transitions. [2021-08-25 20:12:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 20:12:57,256 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:57,256 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] [2021-08-25 20:12:57,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:12:57,257 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1067837001, now seen corresponding path program 1 times [2021-08-25 20:12:57,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:57,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020059616] [2021-08-25 20:12:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:57,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:57,343 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:12:57,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:57,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020059616] [2021-08-25 20:12:57,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020059616] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:57,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:57,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:57,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865876356] [2021-08-25 20:12:57,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:57,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:57,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:57,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,348 INFO L87 Difference]: Start difference. First operand 172 states and 277 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:57,470 INFO L93 Difference]: Finished difference Result 358 states and 575 transitions. [2021-08-25 20:12:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:57,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-25 20:12:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:57,473 INFO L225 Difference]: With dead ends: 358 [2021-08-25 20:12:57,473 INFO L226 Difference]: Without dead ends: 194 [2021-08-25 20:12:57,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-08-25 20:12:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-08-25 20:12:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.5906735751295338) internal successors, (307), 193 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 307 transitions. [2021-08-25 20:12:57,500 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 307 transitions. Word has length 29 [2021-08-25 20:12:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:57,500 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 307 transitions. [2021-08-25 20:12:57,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 307 transitions. [2021-08-25 20:12:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 20:12:57,501 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:57,501 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] [2021-08-25 20:12:57,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:12:57,502 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1369735938, now seen corresponding path program 1 times [2021-08-25 20:12:57,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:57,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118901930] [2021-08-25 20:12:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:57,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:57,570 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:12:57,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:57,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118901930] [2021-08-25 20:12:57,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118901930] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:57,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:57,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:57,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927928961] [2021-08-25 20:12:57,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:57,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,574 INFO L87 Difference]: Start difference. First operand 194 states and 307 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:57,700 INFO L93 Difference]: Finished difference Result 388 states and 616 transitions. [2021-08-25 20:12:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-25 20:12:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:57,702 INFO L225 Difference]: With dead ends: 388 [2021-08-25 20:12:57,702 INFO L226 Difference]: Without dead ends: 202 [2021-08-25 20:12:57,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-25 20:12:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2021-08-25 20:12:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 199 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2021-08-25 20:12:57,713 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 29 [2021-08-25 20:12:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:57,714 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2021-08-25 20:12:57,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2021-08-25 20:12:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 20:12:57,715 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:57,715 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] [2021-08-25 20:12:57,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:12:57,715 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1614302654, now seen corresponding path program 1 times [2021-08-25 20:12:57,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:57,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647344417] [2021-08-25 20:12:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:57,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:57,747 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:12:57,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:57,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647344417] [2021-08-25 20:12:57,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647344417] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:57,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:57,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:57,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303458724] [2021-08-25 20:12:57,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:57,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,750 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:57,877 INFO L93 Difference]: Finished difference Result 393 states and 626 transitions. [2021-08-25 20:12:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-25 20:12:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:57,881 INFO L225 Difference]: With dead ends: 393 [2021-08-25 20:12:57,881 INFO L226 Difference]: Without dead ends: 201 [2021-08-25 20:12:57,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-25 20:12:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-08-25 20:12:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.595) internal successors, (319), 200 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 319 transitions. [2021-08-25 20:12:57,888 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 319 transitions. Word has length 29 [2021-08-25 20:12:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:57,888 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 319 transitions. [2021-08-25 20:12:57,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 319 transitions. [2021-08-25 20:12:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-25 20:12:57,889 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:57,889 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] [2021-08-25 20:12:57,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:12:57,890 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash -210698213, now seen corresponding path program 1 times [2021-08-25 20:12:57,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:57,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117329968] [2021-08-25 20:12:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:57,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:57,917 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:12:57,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:57,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117329968] [2021-08-25 20:12:57,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117329968] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:57,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:57,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:57,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624589752] [2021-08-25 20:12:57,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:57,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:57,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:57,920 INFO L87 Difference]: Start difference. First operand 201 states and 319 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:58,032 INFO L93 Difference]: Finished difference Result 404 states and 638 transitions. [2021-08-25 20:12:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:58,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-08-25 20:12:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:58,033 INFO L225 Difference]: With dead ends: 404 [2021-08-25 20:12:58,034 INFO L226 Difference]: Without dead ends: 211 [2021-08-25 20:12:58,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-25 20:12:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2021-08-25 20:12:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.585) internal successors, (317), 200 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 317 transitions. [2021-08-25 20:12:58,040 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 317 transitions. Word has length 30 [2021-08-25 20:12:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:58,041 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 317 transitions. [2021-08-25 20:12:58,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 317 transitions. [2021-08-25 20:12:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:12:58,042 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:58,042 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:58,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:12:58,042 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash -852120702, now seen corresponding path program 1 times [2021-08-25 20:12:58,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:58,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087408319] [2021-08-25 20:12:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:58,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:58,068 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:12:58,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:58,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087408319] [2021-08-25 20:12:58,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087408319] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:58,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:58,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:58,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754927364] [2021-08-25 20:12:58,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:58,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:58,071 INFO L87 Difference]: Start difference. First operand 201 states and 317 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:58,173 INFO L93 Difference]: Finished difference Result 404 states and 634 transitions. [2021-08-25 20:12:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 20:12:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:58,180 INFO L225 Difference]: With dead ends: 404 [2021-08-25 20:12:58,180 INFO L226 Difference]: Without dead ends: 211 [2021-08-25 20:12:58,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-25 20:12:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2021-08-25 20:12:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.575) internal successors, (315), 200 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 315 transitions. [2021-08-25 20:12:58,189 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 315 transitions. Word has length 31 [2021-08-25 20:12:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:58,189 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 315 transitions. [2021-08-25 20:12:58,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 315 transitions. [2021-08-25 20:12:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:12:58,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:58,191 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:58,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:12:58,192 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1795373184, now seen corresponding path program 1 times [2021-08-25 20:12:58,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:58,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360608138] [2021-08-25 20:12:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:58,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:58,248 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:12:58,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:58,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360608138] [2021-08-25 20:12:58,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360608138] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:58,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:58,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:58,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122239079] [2021-08-25 20:12:58,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:58,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:58,252 INFO L87 Difference]: Start difference. First operand 201 states and 315 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:58,374 INFO L93 Difference]: Finished difference Result 404 states and 630 transitions. [2021-08-25 20:12:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:58,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 20:12:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:58,376 INFO L225 Difference]: With dead ends: 404 [2021-08-25 20:12:58,376 INFO L226 Difference]: Without dead ends: 211 [2021-08-25 20:12:58,377 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-25 20:12:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2021-08-25 20:12:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.565) internal successors, (313), 200 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 313 transitions. [2021-08-25 20:12:58,383 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 313 transitions. Word has length 32 [2021-08-25 20:12:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:58,383 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 313 transitions. [2021-08-25 20:12:58,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions. [2021-08-25 20:12:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:12:58,384 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:58,384 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:58,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:12:58,385 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:58,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1439838815, now seen corresponding path program 1 times [2021-08-25 20:12:58,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:58,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988138591] [2021-08-25 20:12:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:58,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:58,453 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:12:58,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:58,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988138591] [2021-08-25 20:12:58,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988138591] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:58,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:58,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:12:58,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891024428] [2021-08-25 20:12:58,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:12:58,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:58,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:12:58,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:12:58,455 INFO L87 Difference]: Start difference. First operand 201 states and 313 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:58,733 INFO L93 Difference]: Finished difference Result 600 states and 930 transitions. [2021-08-25 20:12:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:12:58,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 20:12:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:58,736 INFO L225 Difference]: With dead ends: 600 [2021-08-25 20:12:58,736 INFO L226 Difference]: Without dead ends: 407 [2021-08-25 20:12:58,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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:12:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-08-25 20:12:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2021-08-25 20:12:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.557591623036649) internal successors, (595), 382 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:12:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions. [2021-08-25 20:12:58,752 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 32 [2021-08-25 20:12:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:58,752 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 595 transitions. [2021-08-25 20:12:58,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions. [2021-08-25 20:12:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:12:58,753 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:58,754 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, 1, 1, 1] [2021-08-25 20:12:58,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:12:58,754 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -443745160, now seen corresponding path program 1 times [2021-08-25 20:12:58,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:58,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178067252] [2021-08-25 20:12:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:58,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:58,784 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:12:58,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:58,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178067252] [2021-08-25 20:12:58,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178067252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:58,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:58,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:58,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745195681] [2021-08-25 20:12:58,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:58,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:58,787 INFO L87 Difference]: Start difference. First operand 383 states and 595 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:58,967 INFO L93 Difference]: Finished difference Result 842 states and 1324 transitions. [2021-08-25 20:12:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-25 20:12:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:58,972 INFO L225 Difference]: With dead ends: 842 [2021-08-25 20:12:58,972 INFO L226 Difference]: Without dead ends: 467 [2021-08-25 20:12:58,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-08-25 20:12:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 449. [2021-08-25 20:12:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.5848214285714286) internal successors, (710), 448 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 710 transitions. [2021-08-25 20:12:58,991 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 710 transitions. Word has length 44 [2021-08-25 20:12:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:58,991 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 710 transitions. [2021-08-25 20:12:58,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 710 transitions. [2021-08-25 20:12:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:12:58,992 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:58,993 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, 1, 1, 1, 1] [2021-08-25 20:12:58,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:12:58,993 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:58,994 INFO L82 PathProgramCache]: Analyzing trace with hash 974176282, now seen corresponding path program 1 times [2021-08-25 20:12:58,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:58,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863140528] [2021-08-25 20:12:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:58,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:59,021 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:12:59,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:59,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863140528] [2021-08-25 20:12:59,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863140528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:59,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:59,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:59,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791124963] [2021-08-25 20:12:59,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:59,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,024 INFO L87 Difference]: Start difference. First operand 449 states and 710 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:59,212 INFO L93 Difference]: Finished difference Result 931 states and 1482 transitions. [2021-08-25 20:12:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:12:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:59,214 INFO L225 Difference]: With dead ends: 931 [2021-08-25 20:12:59,214 INFO L226 Difference]: Without dead ends: 490 [2021-08-25 20:12:59,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:12:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-08-25 20:12:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472. [2021-08-25 20:12:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5987261146496816) internal successors, (753), 471 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:12:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 753 transitions. [2021-08-25 20:12:59,230 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 753 transitions. Word has length 45 [2021-08-25 20:12:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:59,231 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 753 transitions. [2021-08-25 20:12:59,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 753 transitions. [2021-08-25 20:12:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-25 20:12:59,232 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:59,232 INFO L512 BasicCegarLoop]: trace histogram [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:12:59,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:12:59,232 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1540899075, now seen corresponding path program 1 times [2021-08-25 20:12:59,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:59,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716824980] [2021-08-25 20:12:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:59,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 20:12:59,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:59,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716824980] [2021-08-25 20:12:59,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716824980] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:59,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:59,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:59,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269237922] [2021-08-25 20:12:59,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:59,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:59,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,261 INFO L87 Difference]: Start difference. First operand 472 states and 753 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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:12:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:59,426 INFO L93 Difference]: Finished difference Result 988 states and 1578 transitions. [2021-08-25 20:12:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 56 [2021-08-25 20:12:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:59,428 INFO L225 Difference]: With dead ends: 988 [2021-08-25 20:12:59,428 INFO L226 Difference]: Without dead ends: 524 [2021-08-25 20:12:59,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-08-25 20:12:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506. [2021-08-25 20:12:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.5920792079207922) internal successors, (804), 505 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 804 transitions. [2021-08-25 20:12:59,445 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 804 transitions. Word has length 56 [2021-08-25 20:12:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:59,445 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 804 transitions. [2021-08-25 20:12:59,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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:12:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 804 transitions. [2021-08-25 20:12:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:12:59,446 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:59,446 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:12:59,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:12:59,447 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1188180310, now seen corresponding path program 1 times [2021-08-25 20:12:59,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:59,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203793785] [2021-08-25 20:12:59,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:59,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 20:12:59,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:59,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203793785] [2021-08-25 20:12:59,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203793785] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:59,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:59,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:59,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716962572] [2021-08-25 20:12:59,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:59,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:59,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:59,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,474 INFO L87 Difference]: Start difference. First operand 506 states and 804 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:12:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:59,626 INFO L93 Difference]: Finished difference Result 1022 states and 1626 transitions. [2021-08-25 20:12:59,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:59,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 57 [2021-08-25 20:12:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:59,629 INFO L225 Difference]: With dead ends: 1022 [2021-08-25 20:12:59,629 INFO L226 Difference]: Without dead ends: 524 [2021-08-25 20:12:59,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-08-25 20:12:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506. [2021-08-25 20:12:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.5861386138613862) internal successors, (801), 505 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 801 transitions. [2021-08-25 20:12:59,645 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 801 transitions. Word has length 57 [2021-08-25 20:12:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:59,645 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 801 transitions. [2021-08-25 20:12:59,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:12:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 801 transitions. [2021-08-25 20:12:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:12:59,646 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:59,647 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, 1, 1] [2021-08-25 20:12:59,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:12:59,647 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2067348000, now seen corresponding path program 1 times [2021-08-25 20:12:59,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:59,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43190710] [2021-08-25 20:12:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:59,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 20:12:59,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:59,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43190710] [2021-08-25 20:12:59,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43190710] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:59,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:59,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:59,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059825896] [2021-08-25 20:12:59,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:59,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:59,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:59,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,680 INFO L87 Difference]: Start difference. First operand 506 states and 801 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:12:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:59,826 INFO L93 Difference]: Finished difference Result 1069 states and 1697 transitions. [2021-08-25 20:12:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:59,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 57 [2021-08-25 20:12:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:59,829 INFO L225 Difference]: With dead ends: 1069 [2021-08-25 20:12:59,829 INFO L226 Difference]: Without dead ends: 571 [2021-08-25 20:12:59,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-08-25 20:12:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2021-08-25 20:12:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5809859154929577) internal successors, (898), 568 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 898 transitions. [2021-08-25 20:12:59,847 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 898 transitions. Word has length 57 [2021-08-25 20:12:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:59,847 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 898 transitions. [2021-08-25 20:12:59,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:12:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 898 transitions. [2021-08-25 20:12:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-25 20:12:59,848 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:59,849 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:12:59,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:12:59,849 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:59,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:59,849 INFO L82 PathProgramCache]: Analyzing trace with hash -583256949, now seen corresponding path program 1 times [2021-08-25 20:12:59,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:59,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100053995] [2021-08-25 20:12:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:59,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:59,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:59,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100053995] [2021-08-25 20:12:59,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100053995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:59,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:59,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:59,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674658490] [2021-08-25 20:12:59,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:59,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:59,875 INFO L87 Difference]: Start difference. First operand 569 states and 898 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:13:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:00,050 INFO L93 Difference]: Finished difference Result 1179 states and 1859 transitions. [2021-08-25 20:13:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:00,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 79 [2021-08-25 20:13:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:00,053 INFO L225 Difference]: With dead ends: 1179 [2021-08-25 20:13:00,053 INFO L226 Difference]: Without dead ends: 618 [2021-08-25 20:13:00,054 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-08-25 20:13:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2021-08-25 20:13:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 1.574468085106383) internal successors, (962), 611 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 962 transitions. [2021-08-25 20:13:00,073 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 962 transitions. Word has length 79 [2021-08-25 20:13:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:00,073 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 962 transitions. [2021-08-25 20:13:00,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:13:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 962 transitions. [2021-08-25 20:13:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-25 20:13:00,075 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:00,075 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2021-08-25 20:13:00,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:13:00,075 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1357251849, now seen corresponding path program 1 times [2021-08-25 20:13:00,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:00,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365602898] [2021-08-25 20:13:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:00,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:00,101 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:13:00,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:00,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365602898] [2021-08-25 20:13:00,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365602898] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:00,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:00,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:00,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14627419] [2021-08-25 20:13:00,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:00,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:00,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:00,103 INFO L87 Difference]: Start difference. First operand 612 states and 962 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:13:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:00,268 INFO L93 Difference]: Finished difference Result 1222 states and 1920 transitions. [2021-08-25 20:13:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:00,268 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 80 [2021-08-25 20:13:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:00,271 INFO L225 Difference]: With dead ends: 1222 [2021-08-25 20:13:00,271 INFO L226 Difference]: Without dead ends: 618 [2021-08-25 20:13:00,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:13:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-08-25 20:13:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2021-08-25 20:13:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 1.5695581014729951) internal successors, (959), 611 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 959 transitions. [2021-08-25 20:13:00,295 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 959 transitions. Word has length 80 [2021-08-25 20:13:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:00,296 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 959 transitions. [2021-08-25 20:13:00,296 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:13:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 959 transitions. [2021-08-25 20:13:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:00,297 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:00,297 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-08-25 20:13:00,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:13:00,297 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2054627548, now seen corresponding path program 1 times [2021-08-25 20:13:00,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:00,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326583989] [2021-08-25 20:13:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:00,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 20:13:00,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:00,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326583989] [2021-08-25 20:13:00,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326583989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:00,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:00,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:00,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191541195] [2021-08-25 20:13:00,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:00,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:00,323 INFO L87 Difference]: Start difference. First operand 612 states and 959 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:13:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:00,473 INFO L93 Difference]: Finished difference Result 1218 states and 1908 transitions. [2021-08-25 20:13:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:00,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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 85 [2021-08-25 20:13:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:00,476 INFO L225 Difference]: With dead ends: 1218 [2021-08-25 20:13:00,476 INFO L226 Difference]: Without dead ends: 614 [2021-08-25 20:13:00,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:13:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-08-25 20:13:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2021-08-25 20:13:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 1.5613747954173487) internal successors, (954), 611 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 954 transitions. [2021-08-25 20:13:00,496 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 954 transitions. Word has length 85 [2021-08-25 20:13:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:00,496 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 954 transitions. [2021-08-25 20:13:00,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:13:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 954 transitions. [2021-08-25 20:13:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-25 20:13:00,497 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:00,497 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:13:00,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:13:00,498 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1047765588, now seen corresponding path program 1 times [2021-08-25 20:13:00,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:00,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091685934] [2021-08-25 20:13:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:00,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:13:00,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:00,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091685934] [2021-08-25 20:13:00,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091685934] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:00,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:00,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:00,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119681699] [2021-08-25 20:13:00,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:00,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:00,526 INFO L87 Difference]: Start difference. First operand 612 states and 954 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:13:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:00,677 INFO L93 Difference]: Finished difference Result 1276 states and 1991 transitions. [2021-08-25 20:13:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 93 [2021-08-25 20:13:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:00,680 INFO L225 Difference]: With dead ends: 1276 [2021-08-25 20:13:00,680 INFO L226 Difference]: Without dead ends: 672 [2021-08-25 20:13:00,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:13:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-08-25 20:13:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644. [2021-08-25 20:13:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5505443234836702) internal successors, (997), 643 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 997 transitions. [2021-08-25 20:13:00,701 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 997 transitions. Word has length 93 [2021-08-25 20:13:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:00,702 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 997 transitions. [2021-08-25 20:13:00,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:13:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 997 transitions. [2021-08-25 20:13:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-25 20:13:00,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:00,703 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-08-25 20:13:00,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:13:00,704 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1111400187, now seen corresponding path program 1 times [2021-08-25 20:13:00,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:00,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742771785] [2021-08-25 20:13:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:00,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-25 20:13:00,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:00,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742771785] [2021-08-25 20:13:00,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742771785] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:00,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:00,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:00,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335529729] [2021-08-25 20:13:00,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:00,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:00,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:00,737 INFO L87 Difference]: Start difference. First operand 644 states and 997 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:13:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:00,882 INFO L93 Difference]: Finished difference Result 1308 states and 2028 transitions. [2021-08-25 20:13:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 94 [2021-08-25 20:13:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:00,885 INFO L225 Difference]: With dead ends: 1308 [2021-08-25 20:13:00,885 INFO L226 Difference]: Without dead ends: 672 [2021-08-25 20:13:00,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:13:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-08-25 20:13:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644. [2021-08-25 20:13:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5412130637636081) internal successors, (991), 643 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 991 transitions. [2021-08-25 20:13:00,908 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 991 transitions. Word has length 94 [2021-08-25 20:13:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:00,908 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 991 transitions. [2021-08-25 20:13:00,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:13:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 991 transitions. [2021-08-25 20:13:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:13:00,909 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:00,910 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:00,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:13:00,910 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash -51700436, now seen corresponding path program 1 times [2021-08-25 20:13:00,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:00,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547968850] [2021-08-25 20:13:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:00,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 20:13:00,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:00,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547968850] [2021-08-25 20:13:00,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547968850] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:00,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:00,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:00,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640774915] [2021-08-25 20:13:00,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:00,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:00,945 INFO L87 Difference]: Start difference. First operand 644 states and 991 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:01,109 INFO L93 Difference]: Finished difference Result 1344 states and 2068 transitions. [2021-08-25 20:13:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:01,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:13:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:01,112 INFO L225 Difference]: With dead ends: 1344 [2021-08-25 20:13:01,112 INFO L226 Difference]: Without dead ends: 708 [2021-08-25 20:13:01,113 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2021-08-25 20:13:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2021-08-25 20:13:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.5352517985611511) internal successors, (1067), 695 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2021-08-25 20:13:01,134 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2021-08-25 20:13:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:01,134 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2021-08-25 20:13:01,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2021-08-25 20:13:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:13:01,136 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:01,136 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:01,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:13:01,136 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash -530812530, now seen corresponding path program 1 times [2021-08-25 20:13:01,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:01,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68354646] [2021-08-25 20:13:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:01,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 20:13:01,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:01,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68354646] [2021-08-25 20:13:01,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68354646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:01,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:01,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:01,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117039305] [2021-08-25 20:13:01,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:01,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:01,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:01,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,169 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:13:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:01,342 INFO L93 Difference]: Finished difference Result 1401 states and 2150 transitions. [2021-08-25 20:13:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 101 [2021-08-25 20:13:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:01,345 INFO L225 Difference]: With dead ends: 1401 [2021-08-25 20:13:01,346 INFO L226 Difference]: Without dead ends: 709 [2021-08-25 20:13:01,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-08-25 20:13:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 697. [2021-08-25 20:13:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.5344827586206897) internal successors, (1068), 696 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1068 transitions. [2021-08-25 20:13:01,377 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1068 transitions. Word has length 101 [2021-08-25 20:13:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:01,377 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 1068 transitions. [2021-08-25 20:13:01,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:13:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1068 transitions. [2021-08-25 20:13:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:13:01,378 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:01,379 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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, 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:13:01,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:13:01,379 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:01,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:01,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1306174224, now seen corresponding path program 1 times [2021-08-25 20:13:01,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:01,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795928685] [2021-08-25 20:13:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:01,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:13:01,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:01,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795928685] [2021-08-25 20:13:01,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795928685] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:01,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:01,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:01,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064824714] [2021-08-25 20:13:01,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:01,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,414 INFO L87 Difference]: Start difference. First operand 697 states and 1068 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:01,567 INFO L93 Difference]: Finished difference Result 1433 states and 2192 transitions. [2021-08-25 20:13:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:01,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:13:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:01,570 INFO L225 Difference]: With dead ends: 1433 [2021-08-25 20:13:01,570 INFO L226 Difference]: Without dead ends: 744 [2021-08-25 20:13:01,571 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-08-25 20:13:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738. [2021-08-25 20:13:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5237449118046134) internal successors, (1123), 737 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1123 transitions. [2021-08-25 20:13:01,601 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1123 transitions. Word has length 112 [2021-08-25 20:13:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:01,601 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1123 transitions. [2021-08-25 20:13:01,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1123 transitions. [2021-08-25 20:13:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-25 20:13:01,603 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:01,603 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 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:13:01,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:13:01,603 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash -142977294, now seen corresponding path program 1 times [2021-08-25 20:13:01,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:01,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815175771] [2021-08-25 20:13:01,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:01,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:13:01,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:01,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815175771] [2021-08-25 20:13:01,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815175771] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:01,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:01,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:01,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405104665] [2021-08-25 20:13:01,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:01,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,638 INFO L87 Difference]: Start difference. First operand 738 states and 1123 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:13:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:01,797 INFO L93 Difference]: Finished difference Result 1474 states and 2242 transitions. [2021-08-25 20:13:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:01,797 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 113 [2021-08-25 20:13:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:01,800 INFO L225 Difference]: With dead ends: 1474 [2021-08-25 20:13:01,800 INFO L226 Difference]: Without dead ends: 744 [2021-08-25 20:13:01,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-08-25 20:13:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738. [2021-08-25 20:13:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5169606512890095) internal successors, (1118), 737 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2021-08-25 20:13:01,823 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 113 [2021-08-25 20:13:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:01,824 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2021-08-25 20:13:01,824 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:13:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2021-08-25 20:13:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:13:01,825 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:01,825 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:13:01,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:13:01,825 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1809562376, now seen corresponding path program 1 times [2021-08-25 20:13:01,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:01,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842436144] [2021-08-25 20:13:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:01,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-08-25 20:13:01,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:01,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842436144] [2021-08-25 20:13:01,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842436144] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:01,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:01,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:01,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288758616] [2021-08-25 20:13:01,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:01,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:01,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,855 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:13:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:01,982 INFO L93 Difference]: Finished difference Result 1510 states and 2285 transitions. [2021-08-25 20:13:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:01,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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 115 [2021-08-25 20:13:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:01,985 INFO L225 Difference]: With dead ends: 1510 [2021-08-25 20:13:01,985 INFO L226 Difference]: Without dead ends: 780 [2021-08-25 20:13:01,986 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-08-25 20:13:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770. [2021-08-25 20:13:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.5032509752925878) internal successors, (1156), 769 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1156 transitions. [2021-08-25 20:13:02,016 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1156 transitions. Word has length 115 [2021-08-25 20:13:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:02,016 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1156 transitions. [2021-08-25 20:13:02,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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:13:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1156 transitions. [2021-08-25 20:13:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-25 20:13:02,017 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:02,018 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:13:02,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:13:02,018 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:02,019 INFO L82 PathProgramCache]: Analyzing trace with hash 172042817, now seen corresponding path program 1 times [2021-08-25 20:13:02,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:02,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556613809] [2021-08-25 20:13:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:02,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-08-25 20:13:02,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:02,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556613809] [2021-08-25 20:13:02,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556613809] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:02,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:02,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:02,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835199951] [2021-08-25 20:13:02,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:02,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,056 INFO L87 Difference]: Start difference. First operand 770 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:13:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:02,193 INFO L93 Difference]: Finished difference Result 1542 states and 2314 transitions. [2021-08-25 20:13:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:02,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 116 [2021-08-25 20:13:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:02,196 INFO L225 Difference]: With dead ends: 1542 [2021-08-25 20:13:02,196 INFO L226 Difference]: Without dead ends: 780 [2021-08-25 20:13:02,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-08-25 20:13:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770. [2021-08-25 20:13:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.4915474642392719) internal successors, (1147), 769 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1147 transitions. [2021-08-25 20:13:02,221 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1147 transitions. Word has length 116 [2021-08-25 20:13:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:02,221 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1147 transitions. [2021-08-25 20:13:02,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:13:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1147 transitions. [2021-08-25 20:13:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-25 20:13:02,223 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:02,223 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-08-25 20:13:02,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:13:02,223 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:02,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1961382768, now seen corresponding path program 1 times [2021-08-25 20:13:02,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:02,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322531517] [2021-08-25 20:13:02,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:02,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-08-25 20:13:02,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:02,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322531517] [2021-08-25 20:13:02,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322531517] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:02,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:02,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:02,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714562500] [2021-08-25 20:13:02,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:02,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,257 INFO L87 Difference]: Start difference. First operand 770 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:13:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:02,399 INFO L93 Difference]: Finished difference Result 1568 states and 2335 transitions. [2021-08-25 20:13:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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 137 [2021-08-25 20:13:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:02,402 INFO L225 Difference]: With dead ends: 1568 [2021-08-25 20:13:02,402 INFO L226 Difference]: Without dead ends: 806 [2021-08-25 20:13:02,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-08-25 20:13:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798. [2021-08-25 20:13:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.478042659974906) internal successors, (1178), 797 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1178 transitions. [2021-08-25 20:13:02,431 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1178 transitions. Word has length 137 [2021-08-25 20:13:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:02,431 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1178 transitions. [2021-08-25 20:13:02,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:13:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1178 transitions. [2021-08-25 20:13:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-08-25 20:13:02,434 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:02,434 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2021-08-25 20:13:02,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:13:02,434 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:02,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1483046825, now seen corresponding path program 1 times [2021-08-25 20:13:02,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:02,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058874129] [2021-08-25 20:13:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:02,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-08-25 20:13:02,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:02,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058874129] [2021-08-25 20:13:02,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058874129] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:02,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:02,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:02,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919846987] [2021-08-25 20:13:02,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:02,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:02,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:02,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,464 INFO L87 Difference]: Start difference. First operand 798 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:13:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:02,599 INFO L93 Difference]: Finished difference Result 1596 states and 2356 transitions. [2021-08-25 20:13:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 138 [2021-08-25 20:13:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:02,602 INFO L225 Difference]: With dead ends: 1596 [2021-08-25 20:13:02,602 INFO L226 Difference]: Without dead ends: 806 [2021-08-25 20:13:02,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-08-25 20:13:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798. [2021-08-25 20:13:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.465495608531995) internal successors, (1168), 797 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1168 transitions. [2021-08-25 20:13:02,631 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1168 transitions. Word has length 138 [2021-08-25 20:13:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:02,631 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1168 transitions. [2021-08-25 20:13:02,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:13:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1168 transitions. [2021-08-25 20:13:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-25 20:13:02,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:02,633 INFO L512 BasicCegarLoop]: trace histogram [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, 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:13:02,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:13:02,634 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1313212300, now seen corresponding path program 1 times [2021-08-25 20:13:02,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:02,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963716219] [2021-08-25 20:13:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:02,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-25 20:13:02,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:02,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963716219] [2021-08-25 20:13:02,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963716219] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:02,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:02,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:02,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080517073] [2021-08-25 20:13:02,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:02,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,661 INFO L87 Difference]: Start difference. First operand 798 states and 1168 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:13:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:02,836 INFO L93 Difference]: Finished difference Result 1651 states and 2410 transitions. [2021-08-25 20:13:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:02,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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 141 [2021-08-25 20:13:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:02,839 INFO L225 Difference]: With dead ends: 1651 [2021-08-25 20:13:02,839 INFO L226 Difference]: Without dead ends: 861 [2021-08-25 20:13:02,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-08-25 20:13:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 847. [2021-08-25 20:13:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 1.4527186761229314) internal successors, (1229), 846 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1229 transitions. [2021-08-25 20:13:02,867 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1229 transitions. Word has length 141 [2021-08-25 20:13:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:02,867 INFO L470 AbstractCegarLoop]: Abstraction has 847 states and 1229 transitions. [2021-08-25 20:13:02,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:13:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1229 transitions. [2021-08-25 20:13:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-08-25 20:13:02,869 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:02,869 INFO L512 BasicCegarLoop]: trace histogram [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, 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:13:02,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:13:02,870 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash 75909554, now seen corresponding path program 1 times [2021-08-25 20:13:02,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:02,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506790345] [2021-08-25 20:13:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:02,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-25 20:13:02,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:02,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506790345] [2021-08-25 20:13:02,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506790345] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:02,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:02,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:02,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022649054] [2021-08-25 20:13:02,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:02,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:02,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:02,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:02,896 INFO L87 Difference]: Start difference. First operand 847 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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:13:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:03,051 INFO L93 Difference]: Finished difference Result 1700 states and 2468 transitions. [2021-08-25 20:13:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 142 [2021-08-25 20:13:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:03,054 INFO L225 Difference]: With dead ends: 1700 [2021-08-25 20:13:03,054 INFO L226 Difference]: Without dead ends: 845 [2021-08-25 20:13:03,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-08-25 20:13:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 831. [2021-08-25 20:13:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.453012048192771) internal successors, (1206), 830 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1206 transitions. [2021-08-25 20:13:03,080 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1206 transitions. Word has length 142 [2021-08-25 20:13:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:03,080 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1206 transitions. [2021-08-25 20:13:03,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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:13:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1206 transitions. [2021-08-25 20:13:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-08-25 20:13:03,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:03,082 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:13:03,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:13:03,082 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:03,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2072592764, now seen corresponding path program 1 times [2021-08-25 20:13:03,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:03,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964564133] [2021-08-25 20:13:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:03,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:13:03,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:03,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964564133] [2021-08-25 20:13:03,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964564133] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:03,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:03,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:03,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912997327] [2021-08-25 20:13:03,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:03,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:03,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:03,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,112 INFO L87 Difference]: Start difference. First operand 831 states and 1206 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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:13:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:03,256 INFO L93 Difference]: Finished difference Result 1666 states and 2418 transitions. [2021-08-25 20:13:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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 146 [2021-08-25 20:13:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:03,260 INFO L225 Difference]: With dead ends: 1666 [2021-08-25 20:13:03,260 INFO L226 Difference]: Without dead ends: 843 [2021-08-25 20:13:03,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-08-25 20:13:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 831. [2021-08-25 20:13:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.4445783132530121) internal successors, (1199), 830 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1199 transitions. [2021-08-25 20:13:03,286 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1199 transitions. Word has length 146 [2021-08-25 20:13:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:03,286 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1199 transitions. [2021-08-25 20:13:03,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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:13:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1199 transitions. [2021-08-25 20:13:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-25 20:13:03,288 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:03,289 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:13:03,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:13:03,289 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash 369501830, now seen corresponding path program 1 times [2021-08-25 20:13:03,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:03,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935920420] [2021-08-25 20:13:03,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:03,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-08-25 20:13:03,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:03,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935920420] [2021-08-25 20:13:03,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935920420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:03,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:03,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:03,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062968719] [2021-08-25 20:13:03,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:03,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,316 INFO L87 Difference]: Start difference. First operand 831 states and 1199 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:13:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:03,462 INFO L93 Difference]: Finished difference Result 1666 states and 2404 transitions. [2021-08-25 20:13:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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 147 [2021-08-25 20:13:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:03,466 INFO L225 Difference]: With dead ends: 1666 [2021-08-25 20:13:03,466 INFO L226 Difference]: Without dead ends: 826 [2021-08-25 20:13:03,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-08-25 20:13:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 814. [2021-08-25 20:13:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.4391143911439115) internal successors, (1170), 813 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1170 transitions. [2021-08-25 20:13:03,507 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1170 transitions. Word has length 147 [2021-08-25 20:13:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:03,508 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1170 transitions. [2021-08-25 20:13:03,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:13:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1170 transitions. [2021-08-25 20:13:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-08-25 20:13:03,509 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:03,509 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2021-08-25 20:13:03,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:13:03,510 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1770310156, now seen corresponding path program 1 times [2021-08-25 20:13:03,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:03,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851511789] [2021-08-25 20:13:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:03,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-08-25 20:13:03,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:03,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851511789] [2021-08-25 20:13:03,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851511789] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:03,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:03,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:03,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139450715] [2021-08-25 20:13:03,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:03,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:03,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,542 INFO L87 Difference]: Start difference. First operand 814 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:13:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:03,590 INFO L93 Difference]: Finished difference Result 2412 states and 3460 transitions. [2021-08-25 20:13:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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 154 [2021-08-25 20:13:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:03,596 INFO L225 Difference]: With dead ends: 2412 [2021-08-25 20:13:03,596 INFO L226 Difference]: Without dead ends: 1606 [2021-08-25 20:13:03,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-08-25 20:13:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 816. [2021-08-25 20:13:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 1.4380368098159508) internal successors, (1172), 815 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1172 transitions. [2021-08-25 20:13:03,630 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1172 transitions. Word has length 154 [2021-08-25 20:13:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:03,631 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1172 transitions. [2021-08-25 20:13:03,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:13:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1172 transitions. [2021-08-25 20:13:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-08-25 20:13:03,632 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:03,633 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2021-08-25 20:13:03,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:13:03,633 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1570716982, now seen corresponding path program 1 times [2021-08-25 20:13:03,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:03,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422352741] [2021-08-25 20:13:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:03,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2021-08-25 20:13:03,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:03,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422352741] [2021-08-25 20:13:03,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422352741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:03,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:03,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:03,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733720632] [2021-08-25 20:13:03,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:03,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,670 INFO L87 Difference]: Start difference. First operand 816 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:03,726 INFO L93 Difference]: Finished difference Result 2411 states and 3456 transitions. [2021-08-25 20:13:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:03,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-08-25 20:13:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:03,732 INFO L225 Difference]: With dead ends: 2411 [2021-08-25 20:13:03,732 INFO L226 Difference]: Without dead ends: 1603 [2021-08-25 20:13:03,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:13:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2021-08-25 20:13:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1601. [2021-08-25 20:13:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 1.4325) internal successors, (2292), 1600 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2292 transitions. [2021-08-25 20:13:03,805 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2292 transitions. Word has length 154 [2021-08-25 20:13:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:03,805 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 2292 transitions. [2021-08-25 20:13:03,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2292 transitions. [2021-08-25 20:13:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:13:03,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:03,808 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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:13:03,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:13:03,808 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -362729202, now seen corresponding path program 1 times [2021-08-25 20:13:03,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:03,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084125610] [2021-08-25 20:13:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:03,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-08-25 20:13:03,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:03,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084125610] [2021-08-25 20:13:03,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084125610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:03,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:03,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:03,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18395865] [2021-08-25 20:13:03,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:03,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:03,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:03,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:03,878 INFO L87 Difference]: Start difference. First operand 1601 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:03,985 INFO L93 Difference]: Finished difference Result 4747 states and 6780 transitions. [2021-08-25 20:13:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:03,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-08-25 20:13:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:03,996 INFO L225 Difference]: With dead ends: 4747 [2021-08-25 20:13:03,997 INFO L226 Difference]: Without dead ends: 3154 [2021-08-25 20:13:03,999 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2021-08-25 20:13:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 1601. [2021-08-25 20:13:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 1.43) internal successors, (2288), 1600 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2288 transitions. [2021-08-25 20:13:04,104 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2288 transitions. Word has length 156 [2021-08-25 20:13:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:04,104 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 2288 transitions. [2021-08-25 20:13:04,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2288 transitions. [2021-08-25 20:13:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-25 20:13:04,107 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:04,107 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2021-08-25 20:13:04,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:13:04,107 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:04,108 INFO L82 PathProgramCache]: Analyzing trace with hash -957693967, now seen corresponding path program 1 times [2021-08-25 20:13:04,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:04,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241615060] [2021-08-25 20:13:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:04,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-08-25 20:13:04,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:04,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241615060] [2021-08-25 20:13:04,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241615060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:04,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:04,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:04,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799552658] [2021-08-25 20:13:04,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:04,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:04,144 INFO L87 Difference]: Start difference. First operand 1601 states and 2288 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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:13:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:04,336 INFO L93 Difference]: Finished difference Result 4783 states and 6836 transitions. [2021-08-25 20:13:04,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:04,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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 157 [2021-08-25 20:13:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:04,349 INFO L225 Difference]: With dead ends: 4783 [2021-08-25 20:13:04,349 INFO L226 Difference]: Without dead ends: 3190 [2021-08-25 20:13:04,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:13:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2021-08-25 20:13:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3188. [2021-08-25 20:13:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 3187 states have (on average 1.4032005020395357) internal successors, (4472), 3187 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4472 transitions. [2021-08-25 20:13:04,506 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4472 transitions. Word has length 157 [2021-08-25 20:13:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:04,507 INFO L470 AbstractCegarLoop]: Abstraction has 3188 states and 4472 transitions. [2021-08-25 20:13:04,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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:13:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4472 transitions. [2021-08-25 20:13:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-25 20:13:04,510 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:04,510 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2021-08-25 20:13:04,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:13:04,510 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash -3753809, now seen corresponding path program 1 times [2021-08-25 20:13:04,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:04,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404867275] [2021-08-25 20:13:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:04,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:13:04,532 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:13:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:13:04,616 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:13:04,616 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:13:04,617 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:13:04,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:13:04,625 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:13:04,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:13:04 BoogieIcfgContainer [2021-08-25 20:13:04,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:13:04,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:13:04,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:13:04,734 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:13:04,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:56" (3/4) ... [2021-08-25 20:13:04,736 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:13:04,814 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:13:04,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:13:04,815 INFO L168 Benchmark]: Toolchain (without parser) took 9698.78 ms. Allocated memory was 56.6 MB in the beginning and 255.9 MB in the end (delta: 199.2 MB). Free memory was 35.1 MB in the beginning and 123.8 MB in the end (delta: -88.7 MB). Peak memory consumption was 109.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:04,816 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 39.0 MB in the end (delta: 51.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:13:04,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.18 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 35.0 MB in the beginning and 55.9 MB in the end (delta: -20.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:04,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.11 ms. Allocated memory is still 75.5 MB. Free memory was 55.7 MB in the beginning and 52.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:04,816 INFO L168 Benchmark]: Boogie Preprocessor took 77.27 ms. Allocated memory is still 75.5 MB. Free memory was 52.7 MB in the beginning and 50.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:04,817 INFO L168 Benchmark]: RCFGBuilder took 941.44 ms. Allocated memory is still 75.5 MB. Free memory was 50.2 MB in the beginning and 51.1 MB in the end (delta: -853.4 kB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:04,817 INFO L168 Benchmark]: TraceAbstraction took 8172.89 ms. Allocated memory was 75.5 MB in the beginning and 255.9 MB in the end (delta: 180.4 MB). Free memory was 50.3 MB in the beginning and 142.7 MB in the end (delta: -92.4 MB). Peak memory consumption was 87.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:04,817 INFO L168 Benchmark]: Witness Printer took 79.84 ms. Allocated memory is still 255.9 MB. Free memory was 142.7 MB in the beginning and 123.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:04,819 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.22 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 39.0 MB in the end (delta: 51.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 349.18 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 35.0 MB in the beginning and 55.9 MB in the end (delta: -20.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.11 ms. Allocated memory is still 75.5 MB. Free memory was 55.7 MB in the beginning and 52.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.27 ms. Allocated memory is still 75.5 MB. Free memory was 52.7 MB in the beginning and 50.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 941.44 ms. Allocated memory is still 75.5 MB. Free memory was 50.2 MB in the beginning and 51.1 MB in the end (delta: -853.4 kB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8172.89 ms. Allocated memory was 75.5 MB in the beginning and 255.9 MB in the end (delta: 180.4 MB). Free memory was 50.3 MB in the beginning and 142.7 MB in the end (delta: -92.4 MB). Peak memory consumption was 87.5 MB. Max. memory is 16.1 GB. * Witness Printer took 79.84 ms. Allocated memory is still 255.9 MB. Free memory was 142.7 MB in the beginning and 123.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 699]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] int s ; [L705] int tmp ; [L709] s = 8464 [L14] int s__info_callback = __VERIFIER_nondet_int() ; [L15] int s__in_handshake = __VERIFIER_nondet_int() ; [L16] int s__state ; [L17] int s__new_session ; [L18] int s__server ; [L19] int s__version = __VERIFIER_nondet_int() ; [L20] int s__type ; [L21] int s__init_num ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = 1; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__cert = __VERIFIER_nondet_int() ; [L28] int s__options = __VERIFIER_nondet_int() ; [L29] int s__verify_mode = __VERIFIER_nondet_int() ; [L30] int s__session__peer = __VERIFIER_nondet_int() ; [L31] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L32] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L35] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__cert_request ; [L37] int s__s3__tmp__reuse_message ; [L38] int s__s3__tmp__use_rsa_tmp ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_cipher__algo_strength ; [L43] int s__session__cipher ; [L44] int buf ; [L45] unsigned long l ; [L46] unsigned long Time ; [L47] unsigned long tmp ; [L48] int cb ; [L49] long num1 = __VERIFIER_nondet_long() ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int got_new_session ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 ; [L62] long tmp___8 = __VERIFIER_nondet_long() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int tmp___10 = __VERIFIER_nondet_int() ; [L65] int blastFlag ; [L66] int __cil_tmp55 ; [L67] unsigned long __cil_tmp56 ; [L68] unsigned long __cil_tmp57 ; [L69] unsigned long __cil_tmp58 ; [L70] unsigned long __cil_tmp59 ; [L71] int __cil_tmp60 ; [L72] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L76] s__state = initial_state [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] Time = tmp [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] got_new_session = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND FALSE !(tmp___1 + 12288) [L97] COND FALSE !(s__cert == 0) [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND TRUE s__state == 8464 [L274] s__shutdown = 0 [L275] ret = __VERIFIER_nondet_int() [L276] COND TRUE blastFlag == 0 [L277] blastFlag = 1 [L279] COND FALSE !(ret <= 0) [L282] got_new_session = 1 [L283] s__state = 8496 [L284] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND TRUE s__state == 8496 [L288] ret = __VERIFIER_nondet_int() [L289] COND TRUE blastFlag == 1 [L290] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L295] COND FALSE !(\read(s__hit)) [L298] s__state = 8512 [L300] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND TRUE s__state == 8512 [L305] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L306] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L307] COND TRUE __cil_tmp56 + 256UL [L308] __cil_tmp56 = 256345 [L309] skip = 1 [L320] s__state = 8528 [L321] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND TRUE s__state == 8528 [L325] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L326] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L328] __cil_tmp57 = (unsigned long )s__options [L329] COND TRUE __cil_tmp57 + 2097152UL [L330] s__s3__tmp__use_rsa_tmp = 1 [L335] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L363] ret = __VERIFIER_nondet_int() [L364] COND FALSE !(blastFlag == 3) [L367] COND FALSE !(ret <= 0) [L384] s__state = 8544 [L385] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND TRUE s__state == 8544 [L389] COND TRUE s__verify_mode + 1 [L390] COND TRUE s__session__peer != 0 [L391] COND TRUE s__verify_mode + 4 [L392] s__verify_mode = 123 [L393] skip = 1 [L394] s__s3__tmp__cert_request = 0 [L395] s__state = 8560 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND FALSE !(s__state == 8544) [L158] COND FALSE !(s__state == 8545) [L161] COND TRUE s__state == 8560 [L439] ret = __VERIFIER_nondet_int() [L440] COND FALSE !(ret <= 0) [L443] s__s3__tmp__next_state___0 = 8576 [L444] s__state = 8448 [L445] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND TRUE ! s__s3__tmp__reuse_message [L655] COND TRUE ! skip [L656] COND TRUE state == 8560 [L657] COND TRUE s__state == 8448 [L658] COND TRUE s__verify_mode != -1 [L659] COND TRUE s__verify_mode != -2 [L660] COND TRUE __cil_tmp61 != 9021 [L661] COND TRUE __cil_tmp58 != 4294967294 [L662] COND TRUE blastFlag != 4 [L663] COND TRUE tmp___7 != 1024 [L699] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 167 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8007.7ms, OverallIterations: 35, TraceHistogramMax: 6, EmptinessCheckTime: 61.3ms, AutomataDifference: 5280.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7183 SDtfs, 6874 SDslu, 1823 SDs, 0 SdLazy, 2872 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2866.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3188occurred in iteration=34, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 991.9ms AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 81.0ms SsaConstructionTime, 306.0ms SatisfiabilityAnalysisTime, 851.3ms InterpolantComputationTime, 3216 NumberOfCodeBlocks, 3216 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3025 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-25 20:13:04,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...