./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_clnt_3.cil-3.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 942b42bc5f58abe69fc33c6ef5e7218e2daddc6d3f26d56a942671edcc0207b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:56:01,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:56:01,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:56:01,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:56:01,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:56:01,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:56:01,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:56:01,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:56:01,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:56:01,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:56:01,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:56:01,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:56:01,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:56:01,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:56:02,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:56:02,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:56:02,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:56:02,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:56:02,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:56:02,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:56:02,013 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:56:02,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:56:02,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:56:02,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:56:02,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:56:02,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:56:02,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:56:02,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:56:02,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:56:02,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:56:02,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:56:02,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:56:02,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:56:02,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:56:02,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:56:02,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:56:02,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:56:02,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:56:02,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:56:02,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:56:02,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:56:02,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:56:02,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:56:02,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:56:02,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:56:02,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:56:02,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:56:02,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:56:02,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:56:02,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:56:02,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:56:02,073 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:56:02,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:56:02,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:56:02,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:56:02,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:56:02,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:56:02,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:56:02,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:56:02,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:56:02,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:56:02,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:56:02,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:56:02,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:56:02,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:56:02,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:56:02,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:56:02,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:56:02,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:56:02,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:56:02,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:56:02,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:56:02,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:56:02,078 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:56:02,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:56:02,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:56:02,079 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 -> 942b42bc5f58abe69fc33c6ef5e7218e2daddc6d3f26d56a942671edcc0207b7 [2022-07-19 10:56:02,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:56:02,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:56:02,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:56:02,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:56:02,337 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:56:02,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-3.c [2022-07-19 10:56:02,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d692b17/1bdd32d3394b4ef98223a4c00694564c/FLAG515582e3d [2022-07-19 10:56:02,720 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:56:02,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-3.c [2022-07-19 10:56:02,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d692b17/1bdd32d3394b4ef98223a4c00694564c/FLAG515582e3d [2022-07-19 10:56:03,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d692b17/1bdd32d3394b4ef98223a4c00694564c [2022-07-19 10:56:03,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:56:03,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:56:03,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:56:03,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:56:03,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:56:03,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8120e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03, skipping insertion in model container [2022-07-19 10:56:03,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:56:03,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:56:03,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-3.c[37595,37608] [2022-07-19 10:56:03,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:56:03,381 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:56:03,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_3.cil-3.c[37595,37608] [2022-07-19 10:56:03,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:56:03,449 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:56:03,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03 WrapperNode [2022-07-19 10:56:03,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:56:03,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:56:03,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:56:03,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:56:03,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,498 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 526 [2022-07-19 10:56:03,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:56:03,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:56:03,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:56:03,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:56:03,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:56:03,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:56:03,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:56:03,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:56:03,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (1/1) ... [2022-07-19 10:56:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:56:03,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:03,588 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) [2022-07-19 10:56:03,595 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 [2022-07-19 10:56:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:56:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:56:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:56:03,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:56:03,692 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:56:03,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:56:03,704 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:56:04,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-19 10:56:04,123 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-19 10:56:04,123 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:56:04,131 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:56:04,132 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:56:04,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:56:04 BoogieIcfgContainer [2022-07-19 10:56:04,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:56:04,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:56:04,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:56:04,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:56:04,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:56:03" (1/3) ... [2022-07-19 10:56:04,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc13974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:56:04, skipping insertion in model container [2022-07-19 10:56:04,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:56:03" (2/3) ... [2022-07-19 10:56:04,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc13974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:56:04, skipping insertion in model container [2022-07-19 10:56:04,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:56:04" (3/3) ... [2022-07-19 10:56:04,142 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2022-07-19 10:56:04,157 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:56:04,157 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:56:04,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:56:04,220 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d846758, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e6c94c6 [2022-07-19 10:56:04,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:56:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:56:04,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:04,239 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:56:04,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:04,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695038, now seen corresponding path program 1 times [2022-07-19 10:56:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:04,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582804970] [2022-07-19 10:56:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:56:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582804970] [2022-07-19 10:56:04,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582804970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:04,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:04,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893568788] [2022-07-19 10:56:04,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:04,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:04,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:04,550 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:04,725 INFO L93 Difference]: Finished difference Result 252 states and 427 transitions. [2022-07-19 10:56:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:04,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:56:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:04,741 INFO L225 Difference]: With dead ends: 252 [2022-07-19 10:56:04,742 INFO L226 Difference]: Without dead ends: 115 [2022-07-19 10:56:04,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:04,750 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:04,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 325 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-19 10:56:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-19 10:56:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-19 10:56:04,797 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-19 10:56:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:04,798 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-19 10:56:04,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-19 10:56:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:56:04,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:04,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:04,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:56:04,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash 561717339, now seen corresponding path program 1 times [2022-07-19 10:56:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:04,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802022333] [2022-07-19 10:56:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:56:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:04,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802022333] [2022-07-19 10:56:04,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802022333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:04,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:04,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818917278] [2022-07-19 10:56:04,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:04,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:04,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:04,909 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:05,036 INFO L93 Difference]: Finished difference Result 238 states and 360 transitions. [2022-07-19 10:56:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:05,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-19 10:56:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:05,039 INFO L225 Difference]: With dead ends: 238 [2022-07-19 10:56:05,039 INFO L226 Difference]: Without dead ends: 133 [2022-07-19 10:56:05,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,041 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:05,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 244 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-19 10:56:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2022-07-19 10:56:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2022-07-19 10:56:05,051 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2022-07-19 10:56:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:05,052 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2022-07-19 10:56:05,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2022-07-19 10:56:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 10:56:05,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:05,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:05,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:56:05,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:05,055 INFO L85 PathProgramCache]: Analyzing trace with hash 356453796, now seen corresponding path program 1 times [2022-07-19 10:56:05,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:05,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447033543] [2022-07-19 10:56:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:56:05,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:05,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447033543] [2022-07-19 10:56:05,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447033543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:05,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:05,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430963484] [2022-07-19 10:56:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:05,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:05,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,120 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:05,227 INFO L93 Difference]: Finished difference Result 272 states and 408 transitions. [2022-07-19 10:56:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:05,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-19 10:56:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:05,233 INFO L225 Difference]: With dead ends: 272 [2022-07-19 10:56:05,233 INFO L226 Difference]: Without dead ends: 152 [2022-07-19 10:56:05,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,239 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:05,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 257 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-19 10:56:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2022-07-19 10:56:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4657534246575343) internal successors, (214), 146 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2022-07-19 10:56:05,261 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 51 [2022-07-19 10:56:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:05,261 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2022-07-19 10:56:05,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2022-07-19 10:56:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 10:56:05,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:05,263 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:05,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:56:05,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1238030766, now seen corresponding path program 1 times [2022-07-19 10:56:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:05,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018895938] [2022-07-19 10:56:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:56:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018895938] [2022-07-19 10:56:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018895938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:05,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:05,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465247334] [2022-07-19 10:56:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:05,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,357 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:05,489 INFO L93 Difference]: Finished difference Result 335 states and 503 transitions. [2022-07-19 10:56:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-07-19 10:56:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:05,491 INFO L225 Difference]: With dead ends: 335 [2022-07-19 10:56:05,491 INFO L226 Difference]: Without dead ends: 197 [2022-07-19 10:56:05,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,493 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:05,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 231 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-19 10:56:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-07-19 10:56:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.411764705882353) internal successors, (264), 187 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2022-07-19 10:56:05,503 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 68 [2022-07-19 10:56:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:05,504 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2022-07-19 10:56:05,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2022-07-19 10:56:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 10:56:05,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:05,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:05,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:56:05,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1251498196, now seen corresponding path program 1 times [2022-07-19 10:56:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:05,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145785442] [2022-07-19 10:56:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:56:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:05,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145785442] [2022-07-19 10:56:05,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145785442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:05,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:05,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890020048] [2022-07-19 10:56:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:05,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,564 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:05,652 INFO L93 Difference]: Finished difference Result 390 states and 555 transitions. [2022-07-19 10:56:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:05,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-07-19 10:56:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:05,654 INFO L225 Difference]: With dead ends: 390 [2022-07-19 10:56:05,654 INFO L226 Difference]: Without dead ends: 212 [2022-07-19 10:56:05,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,655 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:05,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 262 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-19 10:56:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2022-07-19 10:56:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.3980582524271845) internal successors, (288), 206 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2022-07-19 10:56:05,665 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 68 [2022-07-19 10:56:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:05,666 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2022-07-19 10:56:05,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2022-07-19 10:56:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 10:56:05,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:05,668 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:05,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:56:05,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1821092144, now seen corresponding path program 1 times [2022-07-19 10:56:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:05,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608852731] [2022-07-19 10:56:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 10:56:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:05,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608852731] [2022-07-19 10:56:05,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608852731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:05,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:05,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244246480] [2022-07-19 10:56:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:05,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:05,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:05,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,727 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:05,821 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2022-07-19 10:56:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-19 10:56:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:05,823 INFO L225 Difference]: With dead ends: 428 [2022-07-19 10:56:05,823 INFO L226 Difference]: Without dead ends: 231 [2022-07-19 10:56:05,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,825 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:05,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-19 10:56:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-07-19 10:56:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.3832599118942732) internal successors, (314), 227 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2022-07-19 10:56:05,833 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 85 [2022-07-19 10:56:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:05,833 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2022-07-19 10:56:05,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2022-07-19 10:56:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 10:56:05,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:05,835 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:05,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:56:05,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1901861672, now seen corresponding path program 1 times [2022-07-19 10:56:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:05,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640074403] [2022-07-19 10:56:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 10:56:05,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:05,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640074403] [2022-07-19 10:56:05,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640074403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:05,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:05,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:05,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792961171] [2022-07-19 10:56:05,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:05,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:05,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:05,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:05,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,898 INFO L87 Difference]: Start difference. First operand 228 states and 314 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) [2022-07-19 10:56:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:05,927 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2022-07-19 10:56:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:05,928 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 105 [2022-07-19 10:56:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:05,930 INFO L225 Difference]: With dead ends: 661 [2022-07-19 10:56:05,930 INFO L226 Difference]: Without dead ends: 443 [2022-07-19 10:56:05,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:05,932 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:05,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 363 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-19 10:56:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-07-19 10:56:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3710407239819005) internal successors, (606), 442 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2022-07-19 10:56:05,946 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 105 [2022-07-19 10:56:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:05,946 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2022-07-19 10:56:05,947 INFO L496 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) [2022-07-19 10:56:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2022-07-19 10:56:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 10:56:05,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:05,948 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:05,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:56:05,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash 837467901, now seen corresponding path program 1 times [2022-07-19 10:56:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:05,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453775699] [2022-07-19 10:56:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 10:56:06,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:06,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453775699] [2022-07-19 10:56:06,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453775699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:06,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:06,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766170276] [2022-07-19 10:56:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:06,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:06,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,028 INFO L87 Difference]: Start difference. First operand 443 states and 606 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) [2022-07-19 10:56:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:06,046 INFO L93 Difference]: Finished difference Result 897 states and 1226 transitions. [2022-07-19 10:56:06,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:06,047 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 106 [2022-07-19 10:56:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:06,049 INFO L225 Difference]: With dead ends: 897 [2022-07-19 10:56:06,049 INFO L226 Difference]: Without dead ends: 464 [2022-07-19 10:56:06,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,050 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:06,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-07-19 10:56:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2022-07-19 10:56:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.367170626349892) internal successors, (633), 463 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 633 transitions. [2022-07-19 10:56:06,064 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 633 transitions. Word has length 106 [2022-07-19 10:56:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:06,065 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 633 transitions. [2022-07-19 10:56:06,065 INFO L496 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) [2022-07-19 10:56:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 633 transitions. [2022-07-19 10:56:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 10:56:06,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:06,071 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:56:06,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:06,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1077707647, now seen corresponding path program 1 times [2022-07-19 10:56:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142609324] [2022-07-19 10:56:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-19 10:56:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:06,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142609324] [2022-07-19 10:56:06,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142609324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:06,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:06,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793158705] [2022-07-19 10:56:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:06,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:06,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,136 INFO L87 Difference]: Start difference. First operand 464 states and 633 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:06,154 INFO L93 Difference]: Finished difference Result 945 states and 1287 transitions. [2022-07-19 10:56:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 10:56:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:06,158 INFO L225 Difference]: With dead ends: 945 [2022-07-19 10:56:06,158 INFO L226 Difference]: Without dead ends: 491 [2022-07-19 10:56:06,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,160 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:06,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 315 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-19 10:56:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-19 10:56:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.3612244897959183) internal successors, (667), 490 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 667 transitions. [2022-07-19 10:56:06,171 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 667 transitions. Word has length 106 [2022-07-19 10:56:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:06,171 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 667 transitions. [2022-07-19 10:56:06,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 667 transitions. [2022-07-19 10:56:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 10:56:06,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:06,173 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:06,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:56:06,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2015927886, now seen corresponding path program 1 times [2022-07-19 10:56:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:06,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299611320] [2022-07-19 10:56:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:06,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-19 10:56:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:06,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299611320] [2022-07-19 10:56:06,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299611320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:06,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:06,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860943160] [2022-07-19 10:56:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:06,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,226 INFO L87 Difference]: Start difference. First operand 491 states and 667 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) [2022-07-19 10:56:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:06,252 INFO L93 Difference]: Finished difference Result 709 states and 967 transitions. [2022-07-19 10:56:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:06,252 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 107 [2022-07-19 10:56:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:06,255 INFO L225 Difference]: With dead ends: 709 [2022-07-19 10:56:06,255 INFO L226 Difference]: Without dead ends: 707 [2022-07-19 10:56:06,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,256 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:06,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-07-19 10:56:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2022-07-19 10:56:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.36685552407932) internal successors, (965), 706 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 965 transitions. [2022-07-19 10:56:06,269 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 965 transitions. Word has length 107 [2022-07-19 10:56:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:06,269 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 965 transitions. [2022-07-19 10:56:06,269 INFO L496 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) [2022-07-19 10:56:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 965 transitions. [2022-07-19 10:56:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-19 10:56:06,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:06,271 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:06,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:56:06,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1870688019, now seen corresponding path program 1 times [2022-07-19 10:56:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:06,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47827406] [2022-07-19 10:56:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-19 10:56:06,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47827406] [2022-07-19 10:56:06,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47827406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:06,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:06,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281862780] [2022-07-19 10:56:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:06,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:06,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:06,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:06,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,324 INFO L87 Difference]: Start difference. First operand 707 states and 965 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:06,450 INFO L93 Difference]: Finished difference Result 1530 states and 2149 transitions. [2022-07-19 10:56:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:06,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-07-19 10:56:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:06,454 INFO L225 Difference]: With dead ends: 1530 [2022-07-19 10:56:06,454 INFO L226 Difference]: Without dead ends: 857 [2022-07-19 10:56:06,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,456 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:06,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 196 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-07-19 10:56:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 824. [2022-07-19 10:56:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.402187120291616) internal successors, (1154), 823 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1154 transitions. [2022-07-19 10:56:06,472 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1154 transitions. Word has length 162 [2022-07-19 10:56:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:06,472 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1154 transitions. [2022-07-19 10:56:06,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1154 transitions. [2022-07-19 10:56:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-19 10:56:06,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:06,475 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:06,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:56:06,476 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1491644371, now seen corresponding path program 1 times [2022-07-19 10:56:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:06,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885490678] [2022-07-19 10:56:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-19 10:56:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:06,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885490678] [2022-07-19 10:56:06,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885490678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:06,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:06,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702509668] [2022-07-19 10:56:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:06,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,535 INFO L87 Difference]: Start difference. First operand 824 states and 1154 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) [2022-07-19 10:56:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:06,669 INFO L93 Difference]: Finished difference Result 1892 states and 2730 transitions. [2022-07-19 10:56:06,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:06,670 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 189 [2022-07-19 10:56:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:06,673 INFO L225 Difference]: With dead ends: 1892 [2022-07-19 10:56:06,673 INFO L226 Difference]: Without dead ends: 1054 [2022-07-19 10:56:06,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,675 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 96 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:06,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 203 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-07-19 10:56:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1013. [2022-07-19 10:56:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.3893280632411067) internal successors, (1406), 1012 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1406 transitions. [2022-07-19 10:56:06,696 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1406 transitions. Word has length 189 [2022-07-19 10:56:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:06,696 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1406 transitions. [2022-07-19 10:56:06,697 INFO L496 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) [2022-07-19 10:56:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1406 transitions. [2022-07-19 10:56:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-19 10:56:06,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:06,715 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2022-07-19 10:56:06,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:56:06,715 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -637948485, now seen corresponding path program 1 times [2022-07-19 10:56:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:06,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020722195] [2022-07-19 10:56:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-19 10:56:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:06,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020722195] [2022-07-19 10:56:06,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020722195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:06,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:06,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087505485] [2022-07-19 10:56:06,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:06,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:06,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:06,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,770 INFO L87 Difference]: Start difference. First operand 1013 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:06,894 INFO L93 Difference]: Finished difference Result 2148 states and 3007 transitions. [2022-07-19 10:56:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:06,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2022-07-19 10:56:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:06,899 INFO L225 Difference]: With dead ends: 2148 [2022-07-19 10:56:06,900 INFO L226 Difference]: Without dead ends: 1127 [2022-07-19 10:56:06,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,903 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 99 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:06,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 199 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-07-19 10:56:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1088. [2022-07-19 10:56:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.3817847286108556) internal successors, (1502), 1087 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1502 transitions. [2022-07-19 10:56:06,927 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1502 transitions. Word has length 210 [2022-07-19 10:56:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:06,928 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1502 transitions. [2022-07-19 10:56:06,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1502 transitions. [2022-07-19 10:56:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-19 10:56:06,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:06,931 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:06,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:56:06,932 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 668090344, now seen corresponding path program 1 times [2022-07-19 10:56:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:06,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790771022] [2022-07-19 10:56:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-07-19 10:56:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:06,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790771022] [2022-07-19 10:56:06,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790771022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:06,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:06,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950669597] [2022-07-19 10:56:06,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:06,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:06,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:06,982 INFO L87 Difference]: Start difference. First operand 1088 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:07,119 INFO L93 Difference]: Finished difference Result 2298 states and 3196 transitions. [2022-07-19 10:56:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-07-19 10:56:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:07,124 INFO L225 Difference]: With dead ends: 2298 [2022-07-19 10:56:07,124 INFO L226 Difference]: Without dead ends: 1208 [2022-07-19 10:56:07,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,126 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 100 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:07,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 197 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-07-19 10:56:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1172. [2022-07-19 10:56:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.3774551665243382) internal successors, (1613), 1171 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1613 transitions. [2022-07-19 10:56:07,156 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1613 transitions. Word has length 234 [2022-07-19 10:56:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:07,157 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1613 transitions. [2022-07-19 10:56:07,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1613 transitions. [2022-07-19 10:56:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-19 10:56:07,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:07,161 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:07,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:56:07,161 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash 786531818, now seen corresponding path program 1 times [2022-07-19 10:56:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:07,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655231742] [2022-07-19 10:56:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-07-19 10:56:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:07,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655231742] [2022-07-19 10:56:07,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655231742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:07,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:07,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541564355] [2022-07-19 10:56:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:07,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:07,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,212 INFO L87 Difference]: Start difference. First operand 1172 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:07,334 INFO L93 Difference]: Finished difference Result 2466 states and 3421 transitions. [2022-07-19 10:56:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:07,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-07-19 10:56:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:07,339 INFO L225 Difference]: With dead ends: 2466 [2022-07-19 10:56:07,339 INFO L226 Difference]: Without dead ends: 1304 [2022-07-19 10:56:07,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,344 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 102 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:07,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-07-19 10:56:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1265. [2022-07-19 10:56:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3805379746835442) internal successors, (1745), 1264 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1745 transitions. [2022-07-19 10:56:07,373 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1745 transitions. Word has length 234 [2022-07-19 10:56:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:07,374 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1745 transitions. [2022-07-19 10:56:07,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1745 transitions. [2022-07-19 10:56:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-07-19 10:56:07,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:07,378 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:07,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:56:07,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash 12496008, now seen corresponding path program 1 times [2022-07-19 10:56:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:07,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142632913] [2022-07-19 10:56:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-19 10:56:07,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:07,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142632913] [2022-07-19 10:56:07,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142632913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:07,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:07,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485470104] [2022-07-19 10:56:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:07,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,450 INFO L87 Difference]: Start difference. First operand 1265 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:07,487 INFO L93 Difference]: Finished difference Result 3718 states and 5136 transitions. [2022-07-19 10:56:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:07,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2022-07-19 10:56:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:07,496 INFO L225 Difference]: With dead ends: 3718 [2022-07-19 10:56:07,496 INFO L226 Difference]: Without dead ends: 2490 [2022-07-19 10:56:07,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,498 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:07,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 483 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2022-07-19 10:56:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2488. [2022-07-19 10:56:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 1.3811821471652594) internal successors, (3435), 2487 states have internal predecessors, (3435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3435 transitions. [2022-07-19 10:56:07,557 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3435 transitions. Word has length 264 [2022-07-19 10:56:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:07,557 INFO L495 AbstractCegarLoop]: Abstraction has 2488 states and 3435 transitions. [2022-07-19 10:56:07,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3435 transitions. [2022-07-19 10:56:07,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-07-19 10:56:07,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:07,563 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:07,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:56:07,563 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash 130937482, now seen corresponding path program 1 times [2022-07-19 10:56:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:07,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934493241] [2022-07-19 10:56:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-07-19 10:56:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934493241] [2022-07-19 10:56:07,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934493241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:07,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:07,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392233866] [2022-07-19 10:56:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:07,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:07,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,621 INFO L87 Difference]: Start difference. First operand 2488 states and 3435 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:07,783 INFO L93 Difference]: Finished difference Result 5251 states and 7296 transitions. [2022-07-19 10:56:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2022-07-19 10:56:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:07,793 INFO L225 Difference]: With dead ends: 5251 [2022-07-19 10:56:07,793 INFO L226 Difference]: Without dead ends: 2770 [2022-07-19 10:56:07,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,797 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 117 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:07,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 177 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-07-19 10:56:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2698. [2022-07-19 10:56:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2697 states have (on average 1.389321468298109) internal successors, (3747), 2697 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3747 transitions. [2022-07-19 10:56:07,862 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3747 transitions. Word has length 264 [2022-07-19 10:56:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:07,862 INFO L495 AbstractCegarLoop]: Abstraction has 2698 states and 3747 transitions. [2022-07-19 10:56:07,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3747 transitions. [2022-07-19 10:56:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-19 10:56:07,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:07,868 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 10:56:07,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:56:07,869 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash -142796669, now seen corresponding path program 1 times [2022-07-19 10:56:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:07,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739950425] [2022-07-19 10:56:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-19 10:56:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:07,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739950425] [2022-07-19 10:56:07,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739950425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:07,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:07,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275367561] [2022-07-19 10:56:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:07,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:07,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:07,929 INFO L87 Difference]: Start difference. First operand 2698 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:08,089 INFO L93 Difference]: Finished difference Result 5443 states and 7548 transitions. [2022-07-19 10:56:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:08,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2022-07-19 10:56:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:08,098 INFO L225 Difference]: With dead ends: 5443 [2022-07-19 10:56:08,098 INFO L226 Difference]: Without dead ends: 2764 [2022-07-19 10:56:08,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:08,101 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 122 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:08,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 170 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-07-19 10:56:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2692. [2022-07-19 10:56:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.379041248606466) internal successors, (3711), 2691 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3711 transitions. [2022-07-19 10:56:08,164 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3711 transitions. Word has length 299 [2022-07-19 10:56:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:08,164 INFO L495 AbstractCegarLoop]: Abstraction has 2692 states and 3711 transitions. [2022-07-19 10:56:08,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3711 transitions. [2022-07-19 10:56:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-07-19 10:56:08,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:08,170 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:08,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:56:08,171 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1408099866, now seen corresponding path program 1 times [2022-07-19 10:56:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:08,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090001011] [2022-07-19 10:56:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-07-19 10:56:08,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:08,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090001011] [2022-07-19 10:56:08,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090001011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:08,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:08,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720993373] [2022-07-19 10:56:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:08,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:08,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:08,229 INFO L87 Difference]: Start difference. First operand 2692 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:08,364 INFO L93 Difference]: Finished difference Result 5407 states and 7446 transitions. [2022-07-19 10:56:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2022-07-19 10:56:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:08,374 INFO L225 Difference]: With dead ends: 5407 [2022-07-19 10:56:08,374 INFO L226 Difference]: Without dead ends: 2752 [2022-07-19 10:56:08,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:08,378 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 53 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:08,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 251 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2022-07-19 10:56:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2692. [2022-07-19 10:56:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.358974358974359) internal successors, (3657), 2691 states have internal predecessors, (3657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3657 transitions. [2022-07-19 10:56:08,469 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3657 transitions. Word has length 308 [2022-07-19 10:56:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:08,469 INFO L495 AbstractCegarLoop]: Abstraction has 2692 states and 3657 transitions. [2022-07-19 10:56:08,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3657 transitions. [2022-07-19 10:56:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-07-19 10:56:08,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:08,478 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:08,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:56:08,478 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1960500931, now seen corresponding path program 1 times [2022-07-19 10:56:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:08,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221866238] [2022-07-19 10:56:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:08,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-19 10:56:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:08,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221866238] [2022-07-19 10:56:08,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221866238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:08,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:08,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566032754] [2022-07-19 10:56:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:08,540 INFO L87 Difference]: Start difference. First operand 2692 states and 3657 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:08,691 INFO L93 Difference]: Finished difference Result 5653 states and 7626 transitions. [2022-07-19 10:56:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:08,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2022-07-19 10:56:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:08,701 INFO L225 Difference]: With dead ends: 5653 [2022-07-19 10:56:08,701 INFO L226 Difference]: Without dead ends: 2998 [2022-07-19 10:56:08,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:08,705 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 130 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:08,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 147 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-07-19 10:56:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2782. [2022-07-19 10:56:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 1.3581445523193096) internal successors, (3777), 2781 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3777 transitions. [2022-07-19 10:56:08,787 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 3777 transitions. Word has length 336 [2022-07-19 10:56:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:08,787 INFO L495 AbstractCegarLoop]: Abstraction has 2782 states and 3777 transitions. [2022-07-19 10:56:08,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3777 transitions. [2022-07-19 10:56:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-07-19 10:56:08,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:08,795 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:08,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:56:08,795 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 806996379, now seen corresponding path program 1 times [2022-07-19 10:56:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:08,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871873459] [2022-07-19 10:56:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-07-19 10:56:08,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:08,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871873459] [2022-07-19 10:56:08,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871873459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:08,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:08,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316663026] [2022-07-19 10:56:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:08,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:08,862 INFO L87 Difference]: Start difference. First operand 2782 states and 3777 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:08,939 INFO L93 Difference]: Finished difference Result 7882 states and 10755 transitions. [2022-07-19 10:56:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2022-07-19 10:56:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:08,956 INFO L225 Difference]: With dead ends: 7882 [2022-07-19 10:56:08,956 INFO L226 Difference]: Without dead ends: 5137 [2022-07-19 10:56:08,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:08,961 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 84 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:08,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 445 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-07-19 10:56:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5135. [2022-07-19 10:56:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5135 states, 5134 states have (on average 1.36482275029217) internal successors, (7007), 5134 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5135 states to 5135 states and 7007 transitions. [2022-07-19 10:56:09,091 INFO L78 Accepts]: Start accepts. Automaton has 5135 states and 7007 transitions. Word has length 337 [2022-07-19 10:56:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:09,092 INFO L495 AbstractCegarLoop]: Abstraction has 5135 states and 7007 transitions. [2022-07-19 10:56:09,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5135 states and 7007 transitions. [2022-07-19 10:56:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-07-19 10:56:09,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:09,101 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:09,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:56:09,102 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:09,102 INFO L85 PathProgramCache]: Analyzing trace with hash 722980357, now seen corresponding path program 1 times [2022-07-19 10:56:09,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:09,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51540991] [2022-07-19 10:56:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:09,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-07-19 10:56:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:09,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51540991] [2022-07-19 10:56:09,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51540991] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:09,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883932552] [2022-07-19 10:56:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:09,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:09,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:09,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:56:09,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:56:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:09,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:09,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-07-19 10:56:09,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:56:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-07-19 10:56:09,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883932552] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:56:09,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:56:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 10:56:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470666598] [2022-07-19 10:56:09,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:56:09,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:56:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:09,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:56:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:56:09,617 INFO L87 Difference]: Start difference. First operand 5135 states and 7007 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:10,067 INFO L93 Difference]: Finished difference Result 10235 states and 13947 transitions. [2022-07-19 10:56:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:56:10,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2022-07-19 10:56:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:10,083 INFO L225 Difference]: With dead ends: 10235 [2022-07-19 10:56:10,084 INFO L226 Difference]: Without dead ends: 7748 [2022-07-19 10:56:10,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:56:10,090 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 421 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:10,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 605 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:56:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2022-07-19 10:56:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 5669. [2022-07-19 10:56:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5669 states, 5668 states have (on average 1.3484474241354976) internal successors, (7643), 5668 states have internal predecessors, (7643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 7643 transitions. [2022-07-19 10:56:10,281 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 7643 transitions. Word has length 347 [2022-07-19 10:56:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:10,281 INFO L495 AbstractCegarLoop]: Abstraction has 5669 states and 7643 transitions. [2022-07-19 10:56:10,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 7643 transitions. [2022-07-19 10:56:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-07-19 10:56:10,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:10,297 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:10,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:10,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-19 10:56:10,524 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:10,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1881562091, now seen corresponding path program 1 times [2022-07-19 10:56:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563987983] [2022-07-19 10:56:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-19 10:56:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563987983] [2022-07-19 10:56:10,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563987983] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222062216] [2022-07-19 10:56:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:10,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:10,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:56:10,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:56:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:10,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:10,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-19 10:56:10,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:56:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-19 10:56:10,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222062216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:56:10,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:56:10,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 10:56:10,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445059846] [2022-07-19 10:56:10,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:56:10,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:56:10,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:10,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:56:10,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:56:10,890 INFO L87 Difference]: Start difference. First operand 5669 states and 7643 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:11,223 INFO L93 Difference]: Finished difference Result 12703 states and 17150 transitions. [2022-07-19 10:56:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:56:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 374 [2022-07-19 10:56:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:11,237 INFO L225 Difference]: With dead ends: 12703 [2022-07-19 10:56:11,237 INFO L226 Difference]: Without dead ends: 7058 [2022-07-19 10:56:11,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:56:11,245 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 470 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:11,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 333 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:56:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2022-07-19 10:56:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 5789. [2022-07-19 10:56:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 5788 states have (on average 1.3344851416724257) internal successors, (7724), 5788 states have internal predecessors, (7724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7724 transitions. [2022-07-19 10:56:11,375 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7724 transitions. Word has length 374 [2022-07-19 10:56:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:11,375 INFO L495 AbstractCegarLoop]: Abstraction has 5789 states and 7724 transitions. [2022-07-19 10:56:11,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7724 transitions. [2022-07-19 10:56:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-07-19 10:56:11,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:11,386 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:11,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:11,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-19 10:56:11,599 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1433443056, now seen corresponding path program 1 times [2022-07-19 10:56:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:11,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438720747] [2022-07-19 10:56:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-07-19 10:56:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:11,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438720747] [2022-07-19 10:56:11,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438720747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:11,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:56:11,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:56:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254151722] [2022-07-19 10:56:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:11,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:11,689 INFO L87 Difference]: Start difference. First operand 5789 states and 7724 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:11,831 INFO L93 Difference]: Finished difference Result 11133 states and 14642 transitions. [2022-07-19 10:56:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2022-07-19 10:56:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:11,837 INFO L225 Difference]: With dead ends: 11133 [2022-07-19 10:56:11,837 INFO L226 Difference]: Without dead ends: 3109 [2022-07-19 10:56:11,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:56:11,845 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:11,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 259 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-07-19 10:56:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 3043. [2022-07-19 10:56:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3042 states have (on average 1.3356344510190663) internal successors, (4063), 3042 states have internal predecessors, (4063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4063 transitions. [2022-07-19 10:56:11,897 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4063 transitions. Word has length 413 [2022-07-19 10:56:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:11,897 INFO L495 AbstractCegarLoop]: Abstraction has 3043 states and 4063 transitions. [2022-07-19 10:56:11,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4063 transitions. [2022-07-19 10:56:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-07-19 10:56:11,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:11,902 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:56:11,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:56:11,903 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash -517038626, now seen corresponding path program 1 times [2022-07-19 10:56:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:11,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073017906] [2022-07-19 10:56:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2022-07-19 10:56:11,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073017906] [2022-07-19 10:56:11,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073017906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171997911] [2022-07-19 10:56:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:11,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:11,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:56:11,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:56:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:12,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:12,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2022-07-19 10:56:12,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:56:12,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171997911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:12,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:56:12,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-19 10:56:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017830649] [2022-07-19 10:56:12,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:12,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:12,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:12,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:12,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:12,625 INFO L87 Difference]: Start difference. First operand 3043 states and 4063 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:12,689 INFO L93 Difference]: Finished difference Result 3068 states and 4093 transitions. [2022-07-19 10:56:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:12,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2022-07-19 10:56:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:12,696 INFO L225 Difference]: With dead ends: 3068 [2022-07-19 10:56:12,710 INFO L226 Difference]: Without dead ends: 2571 [2022-07-19 10:56:12,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:12,711 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 61 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:12,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 256 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:56:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-07-19 10:56:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2548. [2022-07-19 10:56:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2547 states have (on average 1.3345111896348645) internal successors, (3399), 2547 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3399 transitions. [2022-07-19 10:56:12,792 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3399 transitions. Word has length 497 [2022-07-19 10:56:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:12,793 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3399 transitions. [2022-07-19 10:56:12,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3399 transitions. [2022-07-19 10:56:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2022-07-19 10:56:12,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:12,798 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 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, 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] [2022-07-19 10:56:12,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:13,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:13,023 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash 706380836, now seen corresponding path program 1 times [2022-07-19 10:56:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:13,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792834699] [2022-07-19 10:56:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 1546 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2022-07-19 10:56:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:13,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792834699] [2022-07-19 10:56:13,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792834699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:13,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192650524] [2022-07-19 10:56:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:13,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:13,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:13,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:56:13,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:56:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:13,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 10:56:13,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2339 trivial. 0 not checked. [2022-07-19 10:56:13,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:56:13,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192650524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:56:13,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:56:13,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-19 10:56:13,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856807224] [2022-07-19 10:56:13,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:56:13,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:56:13,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:13,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:56:13,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:13,306 INFO L87 Difference]: Start difference. First operand 2548 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:13,444 INFO L93 Difference]: Finished difference Result 5167 states and 6909 transitions. [2022-07-19 10:56:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:56:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 498 [2022-07-19 10:56:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:13,455 INFO L225 Difference]: With dead ends: 5167 [2022-07-19 10:56:13,455 INFO L226 Difference]: Without dead ends: 2656 [2022-07-19 10:56:13,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:56:13,458 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:13,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 207 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:56:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2022-07-19 10:56:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2653. [2022-07-19 10:56:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2652 states have (on average 1.2861990950226245) internal successors, (3411), 2652 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3411 transitions. [2022-07-19 10:56:13,516 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3411 transitions. Word has length 498 [2022-07-19 10:56:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:13,516 INFO L495 AbstractCegarLoop]: Abstraction has 2653 states and 3411 transitions. [2022-07-19 10:56:13,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3411 transitions. [2022-07-19 10:56:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2022-07-19 10:56:13,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:56:13,524 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 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, 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] [2022-07-19 10:56:13,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:56:13,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-19 10:56:13,739 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:56:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:56:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash 180586689, now seen corresponding path program 2 times [2022-07-19 10:56:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:56:13,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017845590] [2022-07-19 10:56:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:56:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:56:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:56:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-07-19 10:56:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:56:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017845590] [2022-07-19 10:56:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017845590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:56:13,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347001452] [2022-07-19 10:56:13,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:56:13,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:56:13,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:56:13,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:56:13,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:56:14,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:56:14,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:56:14,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:56:14,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:56:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-07-19 10:56:14,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:56:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2022-07-19 10:56:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347001452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:56:14,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:56:14,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-19 10:56:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937945231] [2022-07-19 10:56:14,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:56:14,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:56:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:56:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:56:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:56:14,171 INFO L87 Difference]: Start difference. First operand 2653 states and 3411 transitions. Second operand has 8 states, 8 states have (on average 41.125) internal successors, (329), 8 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:56:14,360 INFO L93 Difference]: Finished difference Result 2888 states and 3708 transitions. [2022-07-19 10:56:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:56:14,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.125) internal successors, (329), 8 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 609 [2022-07-19 10:56:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:56:14,361 INFO L225 Difference]: With dead ends: 2888 [2022-07-19 10:56:14,361 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:56:14,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1216 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:56:14,364 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 100 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:56:14,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 489 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:56:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:56:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:56:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:56:14,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2022-07-19 10:56:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:56:14,365 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:56:14,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.125) internal successors, (329), 8 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:56:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:56:14,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:56:14,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:56:14,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 10:56:14,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-19 10:56:14,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:56:16,729 INFO L899 garLoopResultBuilder]: For program point L300(lines 300 306) no Hoare annotation was computed. [2022-07-19 10:56:16,729 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 530) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0))) [2022-07-19 10:56:16,729 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-07-19 10:56:16,729 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 468) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 369) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 272) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 528) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 539) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 550) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 305) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 240) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L303-2(lines 222 520) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L895 garLoopResultBuilder]: At program point L171(lines 167 540) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 111) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 504) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2022-07-19 10:56:16,730 INFO L899 garLoopResultBuilder]: For program point L502-2(lines 502 504) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L469-2(lines 469 473) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L370-2(lines 370 374) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 527) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 538) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 549) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 341) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L339-2(lines 222 520) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 528) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse2) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2))) [2022-07-19 10:56:16,731 INFO L895 garLoopResultBuilder]: At program point L141(lines 137 550) the Hoare annotation is: (and (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 110) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L108-2(lines 105 111) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 441) no Hoare annotation was computed. [2022-07-19 10:56:16,731 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 408) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 526) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 537) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 548) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 508 510) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L902 garLoopResultBuilder]: At program point L575(lines 118 576) the Hoare annotation is: true [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 525) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 536) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 547) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 117) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 526) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-07-19 10:56:16,732 INFO L895 garLoopResultBuilder]: At program point L147(lines 143 548) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 116) no Hoare annotation was computed. [2022-07-19 10:56:16,732 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 263) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L247-2(lines 222 520) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 491) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 460) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L446-1(lines 446 460) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L479-2(lines 479 491) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 350) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 283) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 524) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 222 520) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 535) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 546) no Hoare annotation was computed. [2022-07-19 10:56:16,733 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 515) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 524) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-07-19 10:56:16,734 INFO L895 garLoopResultBuilder]: At program point L183(lines 173 538) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L580(lines 580 582) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 384) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 523) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 534) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 545) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L119-1(lines 96 586) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 456) no Hoare annotation was computed. [2022-07-19 10:56:16,734 INFO L902 garLoopResultBuilder]: At program point L219(lines 218 523) the Hoare annotation is: true [2022-07-19 10:56:16,735 INFO L895 garLoopResultBuilder]: At program point L153(lines 149 546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse2 (< 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2) (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)))) [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L485(lines 485 488) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L902 garLoopResultBuilder]: At program point L221(lines 220 523) the Hoare annotation is: true [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 533) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 544) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 555) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L902 garLoopResultBuilder]: At program point L585(lines 22 587) the Hoare annotation is: true [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L321(lines 321 331) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L321-2(lines 321 331) no Hoare annotation was computed. [2022-07-19 10:56:16,735 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 534) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-07-19 10:56:16,735 INFO L895 garLoopResultBuilder]: At program point L123(lines 122 555) the Hoare annotation is: (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-19 10:56:16,735 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 357) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L895 garLoopResultBuilder]: At program point L521(lines 119 574) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse10 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse11 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse12 (not .cse0)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5 .cse6) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse0 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse10 .cse6) (and .cse3 .cse8) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 .cse3 .cse2 .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse7 .cse9 .cse12 .cse10) (and .cse0 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse0 .cse7 .cse11) (and .cse7 .cse4 .cse12 .cse5) (and .cse7 (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1)))) [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L422(lines 422 426) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L895 garLoopResultBuilder]: At program point L356(lines 96 586) the Hoare annotation is: false [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L422-2(lines 222 520) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 532) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 543) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 554) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 261) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L895 garLoopResultBuilder]: At program point L159(lines 155 544) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432) (< 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 572) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 393) no Hoare annotation was computed. [2022-07-19 10:56:16,736 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 360) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 327) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L292(lines 292 294) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L325-2(lines 323 331) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 571) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L895 garLoopResultBuilder]: At program point L227(lines 125 554) the Hoare annotation is: (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 531) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 542) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 553) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 563) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L558-2(lines 557 571) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 532) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L560(lines 560 562) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 400) no Hoare annotation was computed. [2022-07-19 10:56:16,737 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 530) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 541) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 552) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 584) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L895 garLoopResultBuilder]: At program point L165(lines 161 542) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L496-1(lines 496 498) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L232-2(lines 232 234) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L902 garLoopResultBuilder]: At program point L596(lines 588 598) the Hoare annotation is: true [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 434) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 529) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 540) no Hoare annotation was computed. [2022-07-19 10:56:16,738 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 551) no Hoare annotation was computed. [2022-07-19 10:56:16,741 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-19 10:56:16,742 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:56:16,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:56:16 BoogieIcfgContainer [2022-07-19 10:56:16,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:56:16,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:56:16,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:56:16,761 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:56:16,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:56:04" (3/4) ... [2022-07-19 10:56:16,764 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:56:16,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-19 10:56:16,778 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 10:56:16,779 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:56:16,780 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:56:16,844 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:56:16,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:56:16,844 INFO L158 Benchmark]: Toolchain (without parser) took 13723.97ms. Allocated memory was 88.1MB in the beginning and 413.1MB in the end (delta: 325.1MB). Free memory was 52.3MB in the beginning and 330.8MB in the end (delta: -278.5MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2022-07-19 10:56:16,845 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:56:16,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.90ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.2MB in the beginning and 78.6MB in the end (delta: -26.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-19 10:56:16,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.39ms. Allocated memory is still 107.0MB. Free memory was 78.6MB in the beginning and 75.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:56:16,845 INFO L158 Benchmark]: Boogie Preprocessor took 41.40ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:56:16,846 INFO L158 Benchmark]: RCFGBuilder took 592.58ms. Allocated memory is still 107.0MB. Free memory was 73.7MB in the beginning and 69.1MB in the end (delta: 4.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-07-19 10:56:16,846 INFO L158 Benchmark]: TraceAbstraction took 12624.34ms. Allocated memory was 107.0MB in the beginning and 413.1MB in the end (delta: 306.2MB). Free memory was 68.6MB in the beginning and 340.2MB in the end (delta: -271.5MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB. [2022-07-19 10:56:16,846 INFO L158 Benchmark]: Witness Printer took 83.37ms. Allocated memory is still 413.1MB. Free memory was 340.2MB in the beginning and 330.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:56:16,847 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.09ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.90ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.2MB in the beginning and 78.6MB in the end (delta: -26.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.39ms. Allocated memory is still 107.0MB. Free memory was 78.6MB in the beginning and 75.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.40ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.58ms. Allocated memory is still 107.0MB. Free memory was 73.7MB in the beginning and 69.1MB in the end (delta: 4.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12624.34ms. Allocated memory was 107.0MB in the beginning and 413.1MB in the end (delta: 306.2MB). Free memory was 68.6MB in the beginning and 340.2MB in the end (delta: -271.5MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB. * Witness Printer took 83.37ms. Allocated memory is still 413.1MB. Free memory was 340.2MB in the beginning and 330.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 584]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 27, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2679 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2679 mSDsluCounter, 7718 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2882 mSDsCounter, 714 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2743 IncrementalHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 714 mSolverCounterUnsat, 4836 mSDtfsCounter, 2743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3743 GetRequests, 3696 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5789occurred in iteration=23, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 4077 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 426 HoareAnnotationTreeSize, 22 FomulaSimplifications, 5201 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 6976 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 8657 NumberOfCodeBlocks, 8657 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 9952 ConstructedInterpolants, 0 QuantifiedInterpolants, 13391 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4051 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 44503/44624 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) || (((4432 <= s__state && s__hit == 0) && s__state <= 4560) && blastFlag <= 4)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 12292 == s__state && blastFlag == 0 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((s__hit == 0 && s__state <= 4432) && 4384 < s__state) && blastFlag <= 4 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((s__hit == 0 && s__state <= 4432) && 2 == blastFlag) && 4384 < s__state) || ((((s__hit == 0 && s__state <= 4432) && s__s3__tmp__next_state___0 <= 4560) && 4384 < s__state) && blastFlag <= 4) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || (4368 == s__state && blastFlag == 0)) || (((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4400 == s__state)) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state)) || ((s__hit == 0 && 4416 == s__state) && blastFlag <= 4)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4464) && blastFlag <= 4 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4448) && blastFlag <= 4 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: s__state <= 4352 && blastFlag == 0 - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (s__state < 4400 && 4352 <= s__state) && blastFlag == 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (!(4400 <= s__state) && blastFlag == 1) && 4352 <= s__state RESULT: Ultimate proved your program to be correct! [2022-07-19 10:56:16,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE