./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.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/s3_clnt.blast.04.i.cil-1.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 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:00:25,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:00:25,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:00:25,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:00:25,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:00:25,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:00:25,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:00:25,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:00:25,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:00:25,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:00:25,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:00:25,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:00:25,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:00:25,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:00:25,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:00:25,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:00:25,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:00:25,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:00:25,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:00:25,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:00:25,668 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:00:25,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:00:25,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:00:25,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:00:25,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:00:25,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:00:25,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:00:25,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:00:25,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:00:25,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:00:25,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:00:25,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:00:25,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:00:25,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:00:25,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:00:25,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:00:25,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:00:25,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:00:25,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:00:25,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:00:25,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:00:25,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:00:25,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 11:00:25,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:00:25,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:00:25,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:00:25,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:00:25,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:00:25,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:00:25,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:00:25,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:00:25,732 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:00:25,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:00:25,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:00:25,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 11:00:25,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:00:25,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:00:25,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:00:25,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:00:25,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:00:25,734 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:00:25,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:00:25,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:00:25,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:00:25,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:00:25,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:00:25,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:00:25,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:00:25,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:00:25,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:00:25,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:00:25,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 11:00:25,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 11:00:25,738 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:00:25,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:00:25,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:00:25,739 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 -> 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 [2022-07-19 11:00:26,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:00:26,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:00:26,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:00:26,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:00:26,032 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:00:26,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-19 11:00:26,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93020679/f7504141970140e68cb70ca5d8cd263c/FLAGe3e84685f [2022-07-19 11:00:26,601 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:00:26,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-19 11:00:26,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93020679/f7504141970140e68cb70ca5d8cd263c/FLAGe3e84685f [2022-07-19 11:00:26,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93020679/f7504141970140e68cb70ca5d8cd263c [2022-07-19 11:00:26,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:00:26,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:00:26,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:00:26,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:00:26,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:00:26,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:00:26" (1/1) ... [2022-07-19 11:00:26,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf96a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:26, skipping insertion in model container [2022-07-19 11:00:26,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:00:26" (1/1) ... [2022-07-19 11:00:26,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:00:26,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:00:27,310 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/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-19 11:00:27,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:00:27,328 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:00:27,406 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/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-19 11:00:27,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:00:27,423 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:00:27,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27 WrapperNode [2022-07-19 11:00:27,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:00:27,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:00:27,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:00:27,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:00:27,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,485 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-07-19 11:00:27,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:00:27,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:00:27,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:00:27,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:00:27,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:00:27,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:00:27,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:00:27,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:00:27,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (1/1) ... [2022-07-19 11:00:27,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:00:27,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:00:27,642 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 11:00:27,663 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 11:00:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:00:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:00:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 11:00:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 11:00:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:00:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 11:00:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:00:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:00:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:00:27,867 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:00:27,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:00:27,881 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:00:30,644 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-19 11:00:30,645 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-19 11:00:30,645 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:00:30,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:00:30,652 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:00:30,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:00:30 BoogieIcfgContainer [2022-07-19 11:00:30,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:00:30,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:00:30,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:00:30,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:00:30,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:00:26" (1/3) ... [2022-07-19 11:00:30,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f5169c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:00:30, skipping insertion in model container [2022-07-19 11:00:30,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:00:27" (2/3) ... [2022-07-19 11:00:30,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f5169c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:00:30, skipping insertion in model container [2022-07-19 11:00:30,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:00:30" (3/3) ... [2022-07-19 11:00:30,669 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-07-19 11:00:30,683 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:00:30,683 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:00:30,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:00:30,755 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@5d387003, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a340a76 [2022-07-19 11:00:30,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:00:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 11:00:30,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:30,772 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 11:00:30,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-19 11:00:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:30,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562742771] [2022-07-19 11:00:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:31,501 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 11:00:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:31,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562742771] [2022-07-19 11:00:31,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562742771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:31,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:31,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177025471] [2022-07-19 11:00:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:31,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:31,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:31,552 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 11:00:33,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:33,907 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-07-19 11:00:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:00:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 11:00:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:33,924 INFO L225 Difference]: With dead ends: 255 [2022-07-19 11:00:33,925 INFO L226 Difference]: Without dead ends: 116 [2022-07-19 11:00:33,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:00:33,936 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:33,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:00:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-19 11:00:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-19 11:00:33,976 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 11:00:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-19 11:00:33,979 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-19 11:00:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:33,980 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-19 11:00:33,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 11:00:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-19 11:00:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 11:00:33,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:33,982 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, 1] [2022-07-19 11:00:33,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 11:00:33,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:33,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-07-19 11:00:33,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:33,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906849119] [2022-07-19 11:00:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 11:00:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:34,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906849119] [2022-07-19 11:00:34,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906849119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:34,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:34,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:00:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775131812] [2022-07-19 11:00:34,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:34,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:00:34,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:34,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:00:34,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:00:34,297 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:34,347 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-07-19 11:00:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:00:34,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-19 11:00:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:34,355 INFO L225 Difference]: With dead ends: 321 [2022-07-19 11:00:34,356 INFO L226 Difference]: Without dead ends: 216 [2022-07-19 11:00:34,357 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 11:00:34,360 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 124 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 310 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 11:00:34,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 310 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:00:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-19 11:00:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-19 11:00:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4883720930232558) internal successors, (320), 215 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2022-07-19 11:00:34,385 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2022-07-19 11:00:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:34,386 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2022-07-19 11:00:34,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2022-07-19 11:00:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 11:00:34,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:34,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 11:00:34,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2022-07-19 11:00:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:34,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660444499] [2022-07-19 11:00:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 11:00:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660444499] [2022-07-19 11:00:34,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660444499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:34,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:34,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:00:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182282883] [2022-07-19 11:00:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:34,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:00:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:34,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:00:34,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:00:34,657 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 11:00:36,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:36,714 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2022-07-19 11:00:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:00:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-19 11:00:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:36,716 INFO L225 Difference]: With dead ends: 421 [2022-07-19 11:00:36,716 INFO L226 Difference]: Without dead ends: 316 [2022-07-19 11:00:36,717 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 11:00:36,717 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:36,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 11:00:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-19 11:00:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-07-19 11:00:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4825396825396826) internal successors, (467), 315 states have internal predecessors, (467), 0 states have call successors, (0), 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 11:00:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2022-07-19 11:00:36,732 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2022-07-19 11:00:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:36,732 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2022-07-19 11:00:36,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 11:00:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2022-07-19 11:00:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 11:00:36,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:36,734 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:36,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 11:00:36,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2022-07-19 11:00:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:36,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080309344] [2022-07-19 11:00:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:36,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:00:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:36,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080309344] [2022-07-19 11:00:36,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080309344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:36,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:36,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195812562] [2022-07-19 11:00:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:36,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:36,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:36,990 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 11:00:39,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:39,341 INFO L93 Difference]: Finished difference Result 894 states and 1328 transitions. [2022-07-19 11:00:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:00:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-19 11:00:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:39,344 INFO L225 Difference]: With dead ends: 894 [2022-07-19 11:00:39,344 INFO L226 Difference]: Without dead ends: 588 [2022-07-19 11:00:39,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:00:39,346 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:39,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:00:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-19 11:00:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 388. [2022-07-19 11:00:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.5322997416020672) internal successors, (593), 387 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 593 transitions. [2022-07-19 11:00:39,363 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 593 transitions. Word has length 71 [2022-07-19 11:00:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:39,364 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 593 transitions. [2022-07-19 11:00:39,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 11:00:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 593 transitions. [2022-07-19 11:00:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 11:00:39,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:39,366 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:39,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 11:00:39,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2022-07-19 11:00:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:39,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058010593] [2022-07-19 11:00:39,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:00:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:39,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058010593] [2022-07-19 11:00:39,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058010593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:39,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:39,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620551619] [2022-07-19 11:00:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:39,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:39,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:39,619 INFO L87 Difference]: Start difference. First operand 388 states and 593 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 11:00:41,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:43,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:43,981 INFO L93 Difference]: Finished difference Result 944 states and 1441 transitions. [2022-07-19 11:00:43,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:00:43,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-19 11:00:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:43,993 INFO L225 Difference]: With dead ends: 944 [2022-07-19 11:00:43,994 INFO L226 Difference]: Without dead ends: 566 [2022-07-19 11:00:43,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:00:44,002 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 91 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:44,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 11:00:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-07-19 11:00:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 440. [2022-07-19 11:00:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.55125284738041) internal successors, (681), 439 states have internal predecessors, (681), 0 states have call successors, (0), 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 11:00:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 681 transitions. [2022-07-19 11:00:44,019 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 681 transitions. Word has length 72 [2022-07-19 11:00:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:44,020 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 681 transitions. [2022-07-19 11:00:44,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 11:00:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 681 transitions. [2022-07-19 11:00:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 11:00:44,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:44,022 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:44,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 11:00:44,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 91009808, now seen corresponding path program 1 times [2022-07-19 11:00:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:44,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524082126] [2022-07-19 11:00:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:00:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:44,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524082126] [2022-07-19 11:00:44,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524082126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:44,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:44,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:44,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616451633] [2022-07-19 11:00:44,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:44,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:44,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:44,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:44,235 INFO L87 Difference]: Start difference. First operand 440 states and 681 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 11:00:46,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:46,553 INFO L93 Difference]: Finished difference Result 1142 states and 1756 transitions. [2022-07-19 11:00:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:00:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-19 11:00:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:46,557 INFO L225 Difference]: With dead ends: 1142 [2022-07-19 11:00:46,557 INFO L226 Difference]: Without dead ends: 712 [2022-07-19 11:00:46,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:00:46,558 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:46,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:00:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-19 11:00:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 463. [2022-07-19 11:00:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.5692640692640694) internal successors, (725), 462 states have internal predecessors, (725), 0 states have call successors, (0), 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 11:00:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 725 transitions. [2022-07-19 11:00:46,572 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 725 transitions. Word has length 72 [2022-07-19 11:00:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:46,573 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 725 transitions. [2022-07-19 11:00:46,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 11:00:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 725 transitions. [2022-07-19 11:00:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 11:00:46,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:46,575 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:46,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 11:00:46,576 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -406970094, now seen corresponding path program 1 times [2022-07-19 11:00:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:46,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922063924] [2022-07-19 11:00:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:46,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:00:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:46,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922063924] [2022-07-19 11:00:46,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922063924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:46,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:46,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399251702] [2022-07-19 11:00:46,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:46,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:46,798 INFO L87 Difference]: Start difference. First operand 463 states and 725 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:48,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:50,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:51,150 INFO L93 Difference]: Finished difference Result 1094 states and 1703 transitions. [2022-07-19 11:00:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:00:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-19 11:00:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:51,153 INFO L225 Difference]: With dead ends: 1094 [2022-07-19 11:00:51,153 INFO L226 Difference]: Without dead ends: 641 [2022-07-19 11:00:51,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:00:51,155 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:51,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 11:00:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-19 11:00:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 509. [2022-07-19 11:00:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.580708661417323) internal successors, (803), 508 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 803 transitions. [2022-07-19 11:00:51,170 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 803 transitions. Word has length 92 [2022-07-19 11:00:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:51,170 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 803 transitions. [2022-07-19 11:00:51,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 803 transitions. [2022-07-19 11:00:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 11:00:51,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:51,176 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:51,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 11:00:51,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash 486516244, now seen corresponding path program 1 times [2022-07-19 11:00:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:51,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173304484] [2022-07-19 11:00:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 11:00:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:51,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173304484] [2022-07-19 11:00:51,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173304484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:51,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:51,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714462740] [2022-07-19 11:00:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:51,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:51,423 INFO L87 Difference]: Start difference. First operand 509 states and 803 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:53,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:55,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:55,677 INFO L93 Difference]: Finished difference Result 1094 states and 1720 transitions. [2022-07-19 11:00:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:00:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-19 11:00:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:55,681 INFO L225 Difference]: With dead ends: 1094 [2022-07-19 11:00:55,681 INFO L226 Difference]: Without dead ends: 595 [2022-07-19 11:00:55,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:00:55,682 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:55,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 494 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 11:00:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-07-19 11:00:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 549. [2022-07-19 11:00:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5894160583941606) internal successors, (871), 548 states have internal predecessors, (871), 0 states have call successors, (0), 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 11:00:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 871 transitions. [2022-07-19 11:00:55,697 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 871 transitions. Word has length 92 [2022-07-19 11:00:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:55,697 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 871 transitions. [2022-07-19 11:00:55,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:00:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 871 transitions. [2022-07-19 11:00:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 11:00:55,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:55,699 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:55,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 11:00:55,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash 648309393, now seen corresponding path program 1 times [2022-07-19 11:00:55,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:55,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797302943] [2022-07-19 11:00:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:00:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:55,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797302943] [2022-07-19 11:00:55,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797302943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:55,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:55,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015154959] [2022-07-19 11:00:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:55,907 INFO L87 Difference]: Start difference. First operand 549 states and 871 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 11:00:57,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:00:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:00:58,241 INFO L93 Difference]: Finished difference Result 1285 states and 2001 transitions. [2022-07-19 11:00:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:00:58,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 93 [2022-07-19 11:00:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:00:58,244 INFO L225 Difference]: With dead ends: 1285 [2022-07-19 11:00:58,244 INFO L226 Difference]: Without dead ends: 746 [2022-07-19 11:00:58,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:00:58,246 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:00:58,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:00:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-19 11:00:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 549. [2022-07-19 11:00:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5784671532846715) internal successors, (865), 548 states have internal predecessors, (865), 0 states have call successors, (0), 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 11:00:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 865 transitions. [2022-07-19 11:00:58,263 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 865 transitions. Word has length 93 [2022-07-19 11:00:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:00:58,263 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 865 transitions. [2022-07-19 11:00:58,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 11:00:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 865 transitions. [2022-07-19 11:00:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:00:58,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:00:58,265 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:00:58,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 11:00:58,266 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:00:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:00:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 328538170, now seen corresponding path program 2 times [2022-07-19 11:00:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:00:58,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754110585] [2022-07-19 11:00:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:00:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:00:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:00:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:00:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:00:58,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754110585] [2022-07-19 11:00:58,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754110585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:00:58,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:00:58,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:00:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658298250] [2022-07-19 11:00:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:00:58,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:00:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:00:58,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:00:58,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:00:58,465 INFO L87 Difference]: Start difference. First operand 549 states and 865 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:00,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:02,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:02,782 INFO L93 Difference]: Finished difference Result 1282 states and 1986 transitions. [2022-07-19 11:01:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:01:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:02,785 INFO L225 Difference]: With dead ends: 1282 [2022-07-19 11:01:02,785 INFO L226 Difference]: Without dead ends: 743 [2022-07-19 11:01:02,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:02,787 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:02,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 11:01:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-07-19 11:01:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 549. [2022-07-19 11:01:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5602189781021898) internal successors, (855), 548 states have internal predecessors, (855), 0 states have call successors, (0), 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 11:01:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 855 transitions. [2022-07-19 11:01:02,804 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 855 transitions. Word has length 106 [2022-07-19 11:01:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:02,805 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 855 transitions. [2022-07-19 11:01:02,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 855 transitions. [2022-07-19 11:01:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:01:02,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:02,807 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:02,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 11:01:02,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:02,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash 945009752, now seen corresponding path program 1 times [2022-07-19 11:01:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:02,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889243259] [2022-07-19 11:01:02,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:02,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:03,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:03,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889243259] [2022-07-19 11:01:03,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889243259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:03,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:03,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857507644] [2022-07-19 11:01:03,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:03,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:03,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:03,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:03,017 INFO L87 Difference]: Start difference. First operand 549 states and 855 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:05,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:07,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:07,371 INFO L93 Difference]: Finished difference Result 1212 states and 1872 transitions. [2022-07-19 11:01:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:01:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:07,374 INFO L225 Difference]: With dead ends: 1212 [2022-07-19 11:01:07,374 INFO L226 Difference]: Without dead ends: 673 [2022-07-19 11:01:07,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:07,376 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 97 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:07,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 538 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 11:01:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-19 11:01:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 549. [2022-07-19 11:01:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5565693430656935) internal successors, (853), 548 states have internal predecessors, (853), 0 states have call successors, (0), 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 11:01:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 853 transitions. [2022-07-19 11:01:07,390 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 853 transitions. Word has length 106 [2022-07-19 11:01:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:07,391 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 853 transitions. [2022-07-19 11:01:07,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 853 transitions. [2022-07-19 11:01:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:01:07,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:07,393 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:07,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 11:01:07,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1505709530, now seen corresponding path program 1 times [2022-07-19 11:01:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:07,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780595715] [2022-07-19 11:01:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:07,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780595715] [2022-07-19 11:01:07,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780595715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:07,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:07,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:07,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247026750] [2022-07-19 11:01:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:07,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:07,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:07,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:07,578 INFO L87 Difference]: Start difference. First operand 549 states and 853 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:09,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:11,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:11,844 INFO L93 Difference]: Finished difference Result 1132 states and 1748 transitions. [2022-07-19 11:01:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:11,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:01:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:11,848 INFO L225 Difference]: With dead ends: 1132 [2022-07-19 11:01:11,848 INFO L226 Difference]: Without dead ends: 593 [2022-07-19 11:01:11,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:11,849 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:11,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 492 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 11:01:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-19 11:01:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 549. [2022-07-19 11:01:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.552919708029197) internal successors, (851), 548 states have internal predecessors, (851), 0 states have call successors, (0), 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 11:01:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 851 transitions. [2022-07-19 11:01:11,865 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 851 transitions. Word has length 106 [2022-07-19 11:01:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:11,865 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 851 transitions. [2022-07-19 11:01:11,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 851 transitions. [2022-07-19 11:01:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 11:01:11,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:11,867 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:11,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 11:01:11,868 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1643241353, now seen corresponding path program 1 times [2022-07-19 11:01:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:11,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77631737] [2022-07-19 11:01:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77631737] [2022-07-19 11:01:12,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77631737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:12,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:12,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014275170] [2022-07-19 11:01:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:12,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:12,075 INFO L87 Difference]: Start difference. First operand 549 states and 851 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:14,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:14,410 INFO L93 Difference]: Finished difference Result 1283 states and 1959 transitions. [2022-07-19 11:01:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:14,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-19 11:01:14,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:14,413 INFO L225 Difference]: With dead ends: 1283 [2022-07-19 11:01:14,413 INFO L226 Difference]: Without dead ends: 744 [2022-07-19 11:01:14,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:14,414 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 117 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:14,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 286 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-19 11:01:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 549. [2022-07-19 11:01:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5346715328467153) internal successors, (841), 548 states have internal predecessors, (841), 0 states have call successors, (0), 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 11:01:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 841 transitions. [2022-07-19 11:01:14,431 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 841 transitions. Word has length 107 [2022-07-19 11:01:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:14,432 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 841 transitions. [2022-07-19 11:01:14,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 841 transitions. [2022-07-19 11:01:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 11:01:14,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:14,434 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:14,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 11:01:14,434 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash 521678268, now seen corresponding path program 1 times [2022-07-19 11:01:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:14,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023237744] [2022-07-19 11:01:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:14,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023237744] [2022-07-19 11:01:14,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023237744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:14,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:14,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167805656] [2022-07-19 11:01:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:14,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:14,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:14,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:14,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:14,637 INFO L87 Difference]: Start difference. First operand 549 states and 841 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:16,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:16,953 INFO L93 Difference]: Finished difference Result 1167 states and 1766 transitions. [2022-07-19 11:01:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-19 11:01:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:16,957 INFO L225 Difference]: With dead ends: 1167 [2022-07-19 11:01:16,957 INFO L226 Difference]: Without dead ends: 819 [2022-07-19 11:01:16,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:16,959 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:16,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 492 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-07-19 11:01:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 597. [2022-07-19 11:01:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.5201342281879195) internal successors, (906), 596 states have internal predecessors, (906), 0 states have call successors, (0), 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 11:01:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 906 transitions. [2022-07-19 11:01:17,001 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 906 transitions. Word has length 107 [2022-07-19 11:01:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:17,002 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 906 transitions. [2022-07-19 11:01:17,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 906 transitions. [2022-07-19 11:01:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 11:01:17,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:17,004 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:17,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 11:01:17,004 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1921869643, now seen corresponding path program 1 times [2022-07-19 11:01:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:17,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427344693] [2022-07-19 11:01:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:01:17,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:17,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427344693] [2022-07-19 11:01:17,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427344693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:17,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:17,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900929550] [2022-07-19 11:01:17,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:17,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:17,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:17,206 INFO L87 Difference]: Start difference. First operand 597 states and 906 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:19,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:19,590 INFO L93 Difference]: Finished difference Result 1460 states and 2192 transitions. [2022-07-19 11:01:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-19 11:01:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:19,594 INFO L225 Difference]: With dead ends: 1460 [2022-07-19 11:01:19,595 INFO L226 Difference]: Without dead ends: 873 [2022-07-19 11:01:19,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:19,596 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:19,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-19 11:01:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 711. [2022-07-19 11:01:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.5380281690140845) internal successors, (1092), 710 states have internal predecessors, (1092), 0 states have call successors, (0), 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 11:01:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1092 transitions. [2022-07-19 11:01:19,619 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1092 transitions. Word has length 107 [2022-07-19 11:01:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:19,619 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1092 transitions. [2022-07-19 11:01:19,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1092 transitions. [2022-07-19 11:01:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:01:19,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:19,622 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:19,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 11:01:19,622 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1096338685, now seen corresponding path program 1 times [2022-07-19 11:01:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:19,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273104064] [2022-07-19 11:01:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:19,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:19,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273104064] [2022-07-19 11:01:19,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273104064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:19,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:19,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975675003] [2022-07-19 11:01:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:19,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:19,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:19,911 INFO L87 Difference]: Start difference. First operand 711 states and 1092 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:21,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:23,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:24,305 INFO L93 Difference]: Finished difference Result 1536 states and 2344 transitions. [2022-07-19 11:01:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:24,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 11:01:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:24,309 INFO L225 Difference]: With dead ends: 1536 [2022-07-19 11:01:24,309 INFO L226 Difference]: Without dead ends: 835 [2022-07-19 11:01:24,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:24,311 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 91 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:24,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 530 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 11:01:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-19 11:01:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 711. [2022-07-19 11:01:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.5352112676056338) internal successors, (1090), 710 states have internal predecessors, (1090), 0 states have call successors, (0), 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 11:01:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1090 transitions. [2022-07-19 11:01:24,331 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1090 transitions. Word has length 108 [2022-07-19 11:01:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:24,331 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1090 transitions. [2022-07-19 11:01:24,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1090 transitions. [2022-07-19 11:01:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:01:24,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:24,333 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:24,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 11:01:24,334 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:24,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1722268611, now seen corresponding path program 1 times [2022-07-19 11:01:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:24,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406616494] [2022-07-19 11:01:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:24,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406616494] [2022-07-19 11:01:24,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406616494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:24,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:24,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201849994] [2022-07-19 11:01:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:24,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:24,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:24,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:24,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:24,520 INFO L87 Difference]: Start difference. First operand 711 states and 1090 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:26,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:28,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:28,880 INFO L93 Difference]: Finished difference Result 1285 states and 1958 transitions. [2022-07-19 11:01:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 11:01:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:28,887 INFO L225 Difference]: With dead ends: 1285 [2022-07-19 11:01:28,887 INFO L226 Difference]: Without dead ends: 829 [2022-07-19 11:01:28,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:28,889 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 85 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:28,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 524 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 11:01:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-07-19 11:01:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 711. [2022-07-19 11:01:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.532394366197183) internal successors, (1088), 710 states have internal predecessors, (1088), 0 states have call successors, (0), 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 11:01:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1088 transitions. [2022-07-19 11:01:28,916 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1088 transitions. Word has length 108 [2022-07-19 11:01:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:28,916 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1088 transitions. [2022-07-19 11:01:28,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1088 transitions. [2022-07-19 11:01:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:01:28,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:28,919 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:28,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 11:01:28,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:28,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2029459340, now seen corresponding path program 1 times [2022-07-19 11:01:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:28,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955696911] [2022-07-19 11:01:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:01:29,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:29,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955696911] [2022-07-19 11:01:29,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955696911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:29,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:29,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966434288] [2022-07-19 11:01:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:29,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:29,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:29,135 INFO L87 Difference]: Start difference. First operand 711 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:31,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:31,417 INFO L93 Difference]: Finished difference Result 1607 states and 2433 transitions. [2022-07-19 11:01:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 11:01:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:31,421 INFO L225 Difference]: With dead ends: 1607 [2022-07-19 11:01:31,421 INFO L226 Difference]: Without dead ends: 906 [2022-07-19 11:01:31,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:31,422 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:31,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-07-19 11:01:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 747. [2022-07-19 11:01:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.5509383378016086) internal successors, (1157), 746 states have internal predecessors, (1157), 0 states have call successors, (0), 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 11:01:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1157 transitions. [2022-07-19 11:01:31,444 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1157 transitions. Word has length 108 [2022-07-19 11:01:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:31,444 INFO L495 AbstractCegarLoop]: Abstraction has 747 states and 1157 transitions. [2022-07-19 11:01:31,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1157 transitions. [2022-07-19 11:01:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:01:31,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:31,446 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:31,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 11:01:31,446 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1379060519, now seen corresponding path program 1 times [2022-07-19 11:01:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:31,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981318168] [2022-07-19 11:01:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:01:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:31,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981318168] [2022-07-19 11:01:31,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981318168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:31,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:31,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227866358] [2022-07-19 11:01:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:31,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:31,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:31,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:31,635 INFO L87 Difference]: Start difference. First operand 747 states and 1157 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:33,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:35,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:35,894 INFO L93 Difference]: Finished difference Result 1598 states and 2461 transitions. [2022-07-19 11:01:35,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:35,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 11:01:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:35,897 INFO L225 Difference]: With dead ends: 1598 [2022-07-19 11:01:35,897 INFO L226 Difference]: Without dead ends: 861 [2022-07-19 11:01:35,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:35,899 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 61 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:35,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 518 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 11:01:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-07-19 11:01:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 779. [2022-07-19 11:01:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.5539845758354756) internal successors, (1209), 778 states have internal predecessors, (1209), 0 states have call successors, (0), 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 11:01:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1209 transitions. [2022-07-19 11:01:35,933 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1209 transitions. Word has length 108 [2022-07-19 11:01:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:35,933 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1209 transitions. [2022-07-19 11:01:35,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1209 transitions. [2022-07-19 11:01:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:01:35,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:35,935 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:35,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 11:01:35,936 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:35,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1237053953, now seen corresponding path program 1 times [2022-07-19 11:01:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760488175] [2022-07-19 11:01:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:36,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760488175] [2022-07-19 11:01:36,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760488175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:36,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:36,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920973897] [2022-07-19 11:01:36,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:36,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:36,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:36,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:36,119 INFO L87 Difference]: Start difference. First operand 779 states and 1209 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:38,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:38,415 INFO L93 Difference]: Finished difference Result 1707 states and 2603 transitions. [2022-07-19 11:01:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 11:01:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:38,418 INFO L225 Difference]: With dead ends: 1707 [2022-07-19 11:01:38,418 INFO L226 Difference]: Without dead ends: 938 [2022-07-19 11:01:38,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:38,420 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:38,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-19 11:01:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 779. [2022-07-19 11:01:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.5359897172236503) internal successors, (1195), 778 states have internal predecessors, (1195), 0 states have call successors, (0), 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 11:01:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1195 transitions. [2022-07-19 11:01:38,457 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1195 transitions. Word has length 108 [2022-07-19 11:01:38,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:38,458 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1195 transitions. [2022-07-19 11:01:38,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1195 transitions. [2022-07-19 11:01:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:01:38,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:38,460 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:38,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 11:01:38,460 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 239306047, now seen corresponding path program 1 times [2022-07-19 11:01:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:38,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570480485] [2022-07-19 11:01:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:38,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:38,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570480485] [2022-07-19 11:01:38,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570480485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:38,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:38,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083593972] [2022-07-19 11:01:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:38,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:38,728 INFO L87 Difference]: Start difference. First operand 779 states and 1195 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:40,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:41,006 INFO L93 Difference]: Finished difference Result 1489 states and 2259 transitions. [2022-07-19 11:01:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:41,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-19 11:01:41,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:41,012 INFO L225 Difference]: With dead ends: 1489 [2022-07-19 11:01:41,012 INFO L226 Difference]: Without dead ends: 993 [2022-07-19 11:01:41,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:41,014 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 107 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:41,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 474 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:01:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-07-19 11:01:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 782. [2022-07-19 11:01:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.5236875800256082) internal successors, (1190), 781 states have internal predecessors, (1190), 0 states have call successors, (0), 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 11:01:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1190 transitions. [2022-07-19 11:01:41,049 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1190 transitions. Word has length 108 [2022-07-19 11:01:41,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:41,050 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1190 transitions. [2022-07-19 11:01:41,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1190 transitions. [2022-07-19 11:01:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 11:01:41,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:41,052 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:41,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 11:01:41,053 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1494959612, now seen corresponding path program 1 times [2022-07-19 11:01:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:41,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844961331] [2022-07-19 11:01:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:41,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:41,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:41,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844961331] [2022-07-19 11:01:41,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844961331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:41,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:41,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:41,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291255655] [2022-07-19 11:01:41,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:41,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:41,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:41,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:41,232 INFO L87 Difference]: Start difference. First operand 782 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 11:01:43,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:43,510 INFO L93 Difference]: Finished difference Result 1713 states and 2565 transitions. [2022-07-19 11:01:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 109 [2022-07-19 11:01:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:43,514 INFO L225 Difference]: With dead ends: 1713 [2022-07-19 11:01:43,515 INFO L226 Difference]: Without dead ends: 941 [2022-07-19 11:01:43,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:43,516 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 112 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:43,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:01:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-19 11:01:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 782. [2022-07-19 11:01:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.503201024327785) internal successors, (1174), 781 states have internal predecessors, (1174), 0 states have call successors, (0), 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 11:01:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1174 transitions. [2022-07-19 11:01:43,539 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1174 transitions. Word has length 109 [2022-07-19 11:01:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:43,540 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1174 transitions. [2022-07-19 11:01:43,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 11:01:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1174 transitions. [2022-07-19 11:01:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 11:01:43,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:43,542 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:43,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 11:01:43,542 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1195640152, now seen corresponding path program 1 times [2022-07-19 11:01:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:43,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57747085] [2022-07-19 11:01:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:01:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:43,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57747085] [2022-07-19 11:01:43,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57747085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:43,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:43,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:43,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459502039] [2022-07-19 11:01:43,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:43,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:43,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:43,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:43,719 INFO L87 Difference]: Start difference. First operand 782 states and 1174 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:45,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:46,015 INFO L93 Difference]: Finished difference Result 1713 states and 2533 transitions. [2022-07-19 11:01:46,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:46,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-19 11:01:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:46,018 INFO L225 Difference]: With dead ends: 1713 [2022-07-19 11:01:46,018 INFO L226 Difference]: Without dead ends: 941 [2022-07-19 11:01:46,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:46,020 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:46,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-19 11:01:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 788. [2022-07-19 11:01:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.5031766200762389) internal successors, (1183), 787 states have internal predecessors, (1183), 0 states have call successors, (0), 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 11:01:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1183 transitions. [2022-07-19 11:01:46,047 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1183 transitions. Word has length 109 [2022-07-19 11:01:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:46,047 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1183 transitions. [2022-07-19 11:01:46,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1183 transitions. [2022-07-19 11:01:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 11:01:46,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:46,050 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 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 11:01:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 11:01:46,050 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1791034879, now seen corresponding path program 1 times [2022-07-19 11:01:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:46,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008088705] [2022-07-19 11:01:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 11:01:46,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:46,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008088705] [2022-07-19 11:01:46,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008088705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:46,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:46,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:46,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435426516] [2022-07-19 11:01:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:46,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:46,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:46,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:46,231 INFO L87 Difference]: Start difference. First operand 788 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:48,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:48,526 INFO L93 Difference]: Finished difference Result 1719 states and 2539 transitions. [2022-07-19 11:01:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-19 11:01:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:48,529 INFO L225 Difference]: With dead ends: 1719 [2022-07-19 11:01:48,529 INFO L226 Difference]: Without dead ends: 941 [2022-07-19 11:01:48,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:48,531 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:48,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-19 11:01:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 788. [2022-07-19 11:01:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4891994917407878) internal successors, (1172), 787 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1172 transitions. [2022-07-19 11:01:48,555 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1172 transitions. Word has length 110 [2022-07-19 11:01:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:48,555 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1172 transitions. [2022-07-19 11:01:48,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1172 transitions. [2022-07-19 11:01:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 11:01:48,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:48,558 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:01:48,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 11:01:48,558 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1059618658, now seen corresponding path program 1 times [2022-07-19 11:01:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:48,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001858660] [2022-07-19 11:01:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:48,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 11:01:48,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:48,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001858660] [2022-07-19 11:01:48,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001858660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:48,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:48,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:01:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594384501] [2022-07-19 11:01:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:48,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:01:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:01:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:01:48,750 INFO L87 Difference]: Start difference. First operand 788 states and 1172 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:50,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:51,116 INFO L93 Difference]: Finished difference Result 1710 states and 2505 transitions. [2022-07-19 11:01:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:01:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-19 11:01:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:51,119 INFO L225 Difference]: With dead ends: 1710 [2022-07-19 11:01:51,119 INFO L226 Difference]: Without dead ends: 929 [2022-07-19 11:01:51,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:01:51,120 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:51,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:01:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-07-19 11:01:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 794. [2022-07-19 11:01:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.489281210592686) internal successors, (1181), 793 states have internal predecessors, (1181), 0 states have call successors, (0), 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 11:01:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1181 transitions. [2022-07-19 11:01:51,145 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1181 transitions. Word has length 110 [2022-07-19 11:01:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:51,145 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1181 transitions. [2022-07-19 11:01:51,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1181 transitions. [2022-07-19 11:01:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 11:01:51,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:51,148 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 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 11:01:51,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 11:01:51,148 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2086535811, now seen corresponding path program 1 times [2022-07-19 11:01:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:51,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849911287] [2022-07-19 11:01:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:01:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 11:01:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:01:51,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849911287] [2022-07-19 11:01:51,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849911287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:01:51,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:01:51,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:01:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043934411] [2022-07-19 11:01:51,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:01:51,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:01:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:01:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:01:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:01:51,350 INFO L87 Difference]: Start difference. First operand 794 states and 1181 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:53,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:01:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:01:53,423 INFO L93 Difference]: Finished difference Result 1578 states and 2354 transitions. [2022-07-19 11:01:53,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:01:53,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-19 11:01:53,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:01:53,427 INFO L225 Difference]: With dead ends: 1578 [2022-07-19 11:01:53,427 INFO L226 Difference]: Without dead ends: 1074 [2022-07-19 11:01:53,428 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 11:01:53,428 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:01:53,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 468 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:01:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-07-19 11:01:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2022-07-19 11:01:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 1.4874184529356944) internal successors, (1596), 1073 states have internal predecessors, (1596), 0 states have call successors, (0), 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 11:01:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1596 transitions. [2022-07-19 11:01:53,457 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1596 transitions. Word has length 110 [2022-07-19 11:01:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:01:53,457 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1596 transitions. [2022-07-19 11:01:53,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:01:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1596 transitions. [2022-07-19 11:01:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 11:01:53,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:01:53,460 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 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 11:01:53,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 11:01:53,460 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:01:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:01:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2022-07-19 11:01:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:01:53,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369160893] [2022-07-19 11:01:53,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:01:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:01:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:01:54,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:01:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:01:54,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 11:01:54,889 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:01:54,891 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:01:54,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 11:01:54,901 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 11:01:54,904 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:01:55,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:01:55 BoogieIcfgContainer [2022-07-19 11:01:55,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:01:55,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:01:55,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:01:55,048 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:01:55,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:00:30" (3/4) ... [2022-07-19 11:01:55,052 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 11:01:55,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:01:55,053 INFO L158 Benchmark]: Toolchain (without parser) took 88142.37ms. Allocated memory was 94.4MB in the beginning and 255.9MB in the end (delta: 161.5MB). Free memory was 54.9MB in the beginning and 101.6MB in the end (delta: -46.7MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. [2022-07-19 11:01:55,053 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 94.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:01:55,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.89ms. Allocated memory is still 94.4MB. Free memory was 54.8MB in the beginning and 51.7MB in the end (delta: 3.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2022-07-19 11:01:55,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.49ms. Allocated memory is still 94.4MB. Free memory was 51.7MB in the beginning and 47.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 11:01:55,056 INFO L158 Benchmark]: Boogie Preprocessor took 101.86ms. Allocated memory is still 94.4MB. Free memory was 47.1MB in the beginning and 40.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 11:01:55,056 INFO L158 Benchmark]: RCFGBuilder took 3072.37ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 40.4MB in the beginning and 92.4MB in the end (delta: -51.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-07-19 11:01:55,061 INFO L158 Benchmark]: TraceAbstraction took 84385.18ms. Allocated memory was 121.6MB in the beginning and 255.9MB in the end (delta: 134.2MB). Free memory was 91.5MB in the beginning and 102.7MB in the end (delta: -11.2MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. [2022-07-19 11:01:55,062 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 255.9MB. Free memory was 102.7MB in the beginning and 101.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 11:01:55,063 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.23ms. Allocated memory is still 94.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.89ms. Allocated memory is still 94.4MB. Free memory was 54.8MB in the beginning and 51.7MB in the end (delta: 3.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.49ms. Allocated memory is still 94.4MB. Free memory was 51.7MB in the beginning and 47.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.86ms. Allocated memory is still 94.4MB. Free memory was 47.1MB in the beginning and 40.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3072.37ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 40.4MB in the beginning and 92.4MB in the end (delta: -51.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 84385.18ms. Allocated memory was 121.6MB in the beginning and 255.9MB in the end (delta: 134.2MB). Free memory was 91.5MB in the beginning and 102.7MB in the end (delta: -11.2MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 255.9MB. Free memory was 102.7MB in the beginning and 101.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1356. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=-6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:11}, s->wbio={0:-13}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(s->hit) [L1350] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1352] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1356] EXPR s->s3 [L1356] EXPR (s->s3)->tmp.new_cipher [L1356] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967345, (s->s3)->tmp.new_cipher={-7:0}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1359] ret = __VERIFIER_nondet_int() [L1360] COND TRUE blastFlag == 2 [L1361] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 84.2s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 75.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 2438 SdHoareTripleChecker+Valid, 74.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2438 mSDsluCounter, 10164 SdHoareTripleChecker+Invalid, 73.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5840 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4734 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 4324 mSDtfsCounter, 4734 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1074occurred in iteration=26, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 3345 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2554 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2416 ConstructedInterpolants, 0 QuantifiedInterpolants, 6030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 2491/2491 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 11:01:55,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:01:56,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:01:56,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:01:56,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:01:56,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:01:56,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:01:56,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:01:56,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:01:56,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:01:56,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:01:56,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:01:57,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:01:57,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:01:57,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:01:57,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:01:57,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:01:57,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:01:57,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:01:57,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:01:57,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:01:57,010 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:01:57,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:01:57,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:01:57,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:01:57,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:01:57,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:01:57,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:01:57,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:01:57,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:01:57,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:01:57,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:01:57,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:01:57,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:01:57,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:01:57,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:01:57,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:01:57,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:01:57,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:01:57,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:01:57,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:01:57,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:01:57,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:01:57,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 11:01:57,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:01:57,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:01:57,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:01:57,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:01:57,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:01:57,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:01:57,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:01:57,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:01:57,091 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:01:57,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:01:57,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:01:57,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:01:57,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:01:57,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:01:57,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:01:57,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:01:57,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 11:01:57,094 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 11:01:57,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 11:01:57,094 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:01:57,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:01:57,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:01:57,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:01:57,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:01:57,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:01:57,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:01:57,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:01:57,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:01:57,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:01:57,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:01:57,096 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 11:01:57,097 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 11:01:57,097 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:01:57,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:01:57,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:01:57,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 11:01:57,098 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 [2022-07-19 11:01:57,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:01:57,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:01:57,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:01:57,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:01:57,433 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:01:57,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-19 11:01:57,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b02eb1a/94d61041a5fe416698079a0e99a5aff0/FLAGaaac2d509 [2022-07-19 11:01:58,056 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:01:58,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-07-19 11:01:58,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b02eb1a/94d61041a5fe416698079a0e99a5aff0/FLAGaaac2d509 [2022-07-19 11:01:58,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b02eb1a/94d61041a5fe416698079a0e99a5aff0 [2022-07-19 11:01:58,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:01:58,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:01:58,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:01:58,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:01:58,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:01:58,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:58,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb004cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58, skipping insertion in model container [2022-07-19 11:01:58,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:58,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:01:58,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:01:58,798 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/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-19 11:01:58,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:01:58,831 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 11:01:58,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:01:58,911 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/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-19 11:01:58,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:01:58,921 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:01:58,980 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/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-07-19 11:01:58,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:01:58,996 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:01:58,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58 WrapperNode [2022-07-19 11:01:58,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:01:58,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:01:58,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:01:58,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:01:59,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,075 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-07-19 11:01:59,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:01:59,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:01:59,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:01:59,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:01:59,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:01:59,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:01:59,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:01:59,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:01:59,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (1/1) ... [2022-07-19 11:01:59,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:01:59,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:01:59,220 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 11:01:59,247 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 11:01:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:01:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 11:01:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:01:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 11:01:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:01:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:01:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:01:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:01:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 11:01:59,412 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:01:59,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:01:59,441 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:02:07,583 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-19 11:02:07,583 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-19 11:02:07,583 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:02:07,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:02:07,589 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:02:07,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:07 BoogieIcfgContainer [2022-07-19 11:02:07,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:02:07,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:02:07,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:02:07,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:02:07,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:01:58" (1/3) ... [2022-07-19 11:02:07,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c618dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:07, skipping insertion in model container [2022-07-19 11:02:07,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:01:58" (2/3) ... [2022-07-19 11:02:07,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c618dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:07, skipping insertion in model container [2022-07-19 11:02:07,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:07" (3/3) ... [2022-07-19 11:02:07,598 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-07-19 11:02:07,610 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:02:07,611 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:02:07,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:02:07,659 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@7a72cf9e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@141ed0b1 [2022-07-19 11:02:07,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:02:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 11:02:07,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:07,671 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 11:02:07,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-19 11:02:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:02:07,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943493214] [2022-07-19 11:02:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:02:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:02:07,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:02:07,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 11:02:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:08,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:02:08,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:02:08,717 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 11:02:08,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:02:08,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:02:08,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943493214] [2022-07-19 11:02:08,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943493214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:08,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:08,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:08,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994475582] [2022-07-19 11:02:08,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:08,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:02:08,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:08,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:08,748 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 11:02:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:08,885 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2022-07-19 11:02:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:08,887 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 11:02:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:08,896 INFO L225 Difference]: With dead ends: 369 [2022-07-19 11:02:08,896 INFO L226 Difference]: Without dead ends: 213 [2022-07-19 11:02:08,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 11:02:08,902 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 180 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 400 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:08,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:02:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-19 11:02:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-07-19 11:02:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-07-19 11:02:08,946 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-07-19 11:02:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:08,946 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-07-19 11:02:08,946 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 11:02:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-07-19 11:02:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 11:02:08,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:08,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:08,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 11:02:09,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:02:09,169 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:09,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:09,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2022-07-19 11:02:09,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:02:09,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804078510] [2022-07-19 11:02:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:09,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:02:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:02:09,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:02:09,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 11:02:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:09,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:02:10,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:02:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:10,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:02:10,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:02:10,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804078510] [2022-07-19 11:02:10,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804078510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:10,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:10,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461410729] [2022-07-19 11:02:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:10,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:02:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:10,154 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:12,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:12,316 INFO L93 Difference]: Finished difference Result 418 states and 628 transitions. [2022-07-19 11:02:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-19 11:02:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:12,320 INFO L225 Difference]: With dead ends: 418 [2022-07-19 11:02:12,320 INFO L226 Difference]: Without dead ends: 313 [2022-07-19 11:02:12,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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 11:02:12,321 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:12,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:02:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-19 11:02:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-07-19 11:02:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4871794871794872) internal successors, (464), 312 states have internal predecessors, (464), 0 states have call successors, (0), 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 11:02:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 464 transitions. [2022-07-19 11:02:12,358 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 464 transitions. Word has length 39 [2022-07-19 11:02:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:12,361 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 464 transitions. [2022-07-19 11:02:12,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 464 transitions. [2022-07-19 11:02:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 11:02:12,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:12,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:12,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 11:02:12,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:02:12,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1701754597, now seen corresponding path program 1 times [2022-07-19 11:02:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:02:12,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879009435] [2022-07-19 11:02:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:12,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:02:12,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:02:12,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:02:12,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 11:02:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:13,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:02:13,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:02:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 11:02:13,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:02:13,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:02:13,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879009435] [2022-07-19 11:02:13,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879009435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:13,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:13,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293994146] [2022-07-19 11:02:13,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:13,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:02:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:13,559 INFO L87 Difference]: Start difference. First operand 313 states and 464 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 11:02:15,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:15,682 INFO L93 Difference]: Finished difference Result 619 states and 923 transitions. [2022-07-19 11:02:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-19 11:02:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:15,685 INFO L225 Difference]: With dead ends: 619 [2022-07-19 11:02:15,685 INFO L226 Difference]: Without dead ends: 414 [2022-07-19 11:02:15,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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 11:02:15,696 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:15,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 468 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:02:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-19 11:02:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-19 11:02:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4842615012106537) internal successors, (613), 413 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-07-19 11:02:15,732 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-07-19 11:02:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:15,732 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-07-19 11:02:15,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 11:02:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-07-19 11:02:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 11:02:15,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:15,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:15,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 11:02:15,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:02:15,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -998738617, now seen corresponding path program 1 times [2022-07-19 11:02:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:02:15,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657048802] [2022-07-19 11:02:15,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:15,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:02:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:02:15,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:02:15,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 11:02:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:16,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:02:16,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:02:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 11:02:17,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:02:17,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:02:17,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657048802] [2022-07-19 11:02:17,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657048802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:17,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:17,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:17,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577918704] [2022-07-19 11:02:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:17,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:02:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:17,038 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:19,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:19,147 INFO L93 Difference]: Finished difference Result 821 states and 1222 transitions. [2022-07-19 11:02:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:19,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-19 11:02:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:19,157 INFO L225 Difference]: With dead ends: 821 [2022-07-19 11:02:19,157 INFO L226 Difference]: Without dead ends: 515 [2022-07-19 11:02:19,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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 11:02:19,159 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:19,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:02:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-19 11:02:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-07-19 11:02:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.482490272373541) internal successors, (762), 514 states have internal predecessors, (762), 0 states have call successors, (0), 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 11:02:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-07-19 11:02:19,183 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-07-19 11:02:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:19,183 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-07-19 11:02:19,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-07-19 11:02:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 11:02:19,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:19,187 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-19 11:02:19,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 11:02:19,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:02:19,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash 465583256, now seen corresponding path program 1 times [2022-07-19 11:02:19,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:02:19,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838432879] [2022-07-19 11:02:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:02:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:02:19,399 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:02:19,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 11:02:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:20,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 11:02:20,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:02:22,484 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-19 11:02:22,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1482 treesize of output 1090 [2022-07-19 11:02:42,411 WARN L233 SmtUtils]: Spent 19.80s on a formula simplification. DAG size of input: 205 DAG size of output: 93 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-19 11:02:42,412 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-19 11:02:42,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 4790 treesize of output 4750 [2022-07-19 11:02:42,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4345 treesize of output 3031 [2022-07-19 11:02:43,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 11:02:43,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2466 treesize of output 1710 [2022-07-19 11:02:45,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 11:02:45,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 968 treesize of output 891 [2022-07-19 11:02:45,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:45,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:46,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:46,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:46,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:46,691 INFO L244 Elim1Store]: Index analysis took 1069 ms [2022-07-19 11:02:47,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 87 [2022-07-19 11:02:48,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:48,664 INFO L244 Elim1Store]: Index analysis took 687 ms [2022-07-19 11:02:49,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-19 11:02:49,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:02:50,877 INFO L244 Elim1Store]: Index analysis took 956 ms [2022-07-19 11:02:51,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-19 11:02:52,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 371 [2022-07-19 11:02:52,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 123 [2022-07-19 11:02:52,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115