./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/s3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/loops/s3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:30:42,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:30:42,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:30:42,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:30:42,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:30:42,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:30:42,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:30:42,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:30:42,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:30:42,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:30:42,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:30:42,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:30:42,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:30:42,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:30:42,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:30:42,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:30:42,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:30:42,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:30:42,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:30:42,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:30:42,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:30:42,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:30:42,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:30:42,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:30:42,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:30:42,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:30:42,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:30:42,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:30:42,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:30:42,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:30:42,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:30:42,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:30:42,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:30:42,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:30:42,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:30:42,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:30:42,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:30:42,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:30:42,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:30:42,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:30:42,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:30:42,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:30:42,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:30:42,722 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:30:42,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:30:42,723 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:30:42,723 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:30:42,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:30:42,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:30:42,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:30:42,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:30:42,726 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:30:42,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:30:42,727 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:30:42,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:30:42,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:30:42,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:30:42,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:30:42,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:30:42,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:30:42,736 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:30:42,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:30:42,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:30:42,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:30:42,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:30:42,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:30:42,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:30:42,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:30:42,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:30:42,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:30:42,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:30:42,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:30:42,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:30:42,739 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:30:42,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:30:42,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:30:42,740 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 -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-21 02:30:43,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:30:43,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:30:43,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:30:43,134 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:30:43,134 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:30:43,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-21 02:30:43,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048cec068/2c990e0ef10e46f29c72ee18d5b96d4a/FLAG343e82acd [2022-07-21 02:30:43,796 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:30:43,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-21 02:30:43,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048cec068/2c990e0ef10e46f29c72ee18d5b96d4a/FLAG343e82acd [2022-07-21 02:30:44,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048cec068/2c990e0ef10e46f29c72ee18d5b96d4a [2022-07-21 02:30:44,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:30:44,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:30:44,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:30:44,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:30:44,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:30:44,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:44,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d054c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44, skipping insertion in model container [2022-07-21 02:30:44,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:44,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:30:44,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:30:44,687 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/loops/s3.i[64167,64180] [2022-07-21 02:30:44,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:30:44,717 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:30:44,856 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/loops/s3.i[64167,64180] [2022-07-21 02:30:44,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:30:44,878 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:30:44,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44 WrapperNode [2022-07-21 02:30:44,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:30:44,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:30:44,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:30:44,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:30:44,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:44,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:44,979 INFO L137 Inliner]: procedures = 30, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 732 [2022-07-21 02:30:44,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:30:44,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:30:44,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:30:44,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:30:44,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:44,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:45,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:45,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:45,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:45,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:45,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:45,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:30:45,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:30:45,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:30:45,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:30:45,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (1/1) ... [2022-07-21 02:30:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:30:45,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:30:45,121 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-21 02:30:45,145 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-21 02:30:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:30:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:30:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:30:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:30:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:30:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:30:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:30:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:30:45,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:30:45,370 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:30:45,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:30:45,392 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 02:30:48,218 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-21 02:30:48,231 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-21 02:30:48,231 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:30:48,238 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:30:48,238 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 02:30:48,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:30:48 BoogieIcfgContainer [2022-07-21 02:30:48,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:30:48,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:30:48,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:30:48,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:30:48,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:30:44" (1/3) ... [2022-07-21 02:30:48,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14df620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:30:48, skipping insertion in model container [2022-07-21 02:30:48,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:44" (2/3) ... [2022-07-21 02:30:48,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14df620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:30:48, skipping insertion in model container [2022-07-21 02:30:48,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:30:48" (3/3) ... [2022-07-21 02:30:48,264 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-21 02:30:48,297 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:30:48,298 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:30:48,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:30:48,379 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@537128a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51f7fcc2 [2022-07-21 02:30:48,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:30:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:30:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 02:30:48,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:30:48,392 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-21 02:30:48,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:30:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:30:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-21 02:30:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:30:48,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292709148] [2022-07-21 02:30:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:30:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:30:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:30:49,006 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-21 02:30:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:30:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292709148] [2022-07-21 02:30:49,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292709148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:30:49,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:30:49,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:30:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253520012] [2022-07-21 02:30:49,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:30:49,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:30:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:30:49,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:30:49,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:30:49,056 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-21 02:30:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:30:49,194 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-21 02:30:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:30:49,197 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-21 02:30:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:30:49,212 INFO L225 Difference]: With dead ends: 375 [2022-07-21 02:30:49,212 INFO L226 Difference]: Without dead ends: 217 [2022-07-21 02:30:49,217 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-21 02:30:49,224 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 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-21 02:30:49,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:30:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-21 02:30:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-21 02:30:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 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-21 02:30:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-21 02:30:49,295 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-21 02:30:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:30:49,296 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-21 02:30:49,296 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-21 02:30:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-21 02:30:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 02:30:49,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:30:49,299 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-21 02:30:49,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:30:49,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:30:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:30:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-21 02:30:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:30:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82634859] [2022-07-21 02:30:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:30:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:30:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:30:49,606 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-21 02:30:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:30:49,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82634859] [2022-07-21 02:30:49,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82634859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:30:49,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:30:49,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:30:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125599196] [2022-07-21 02:30:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:30:49,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:30:49,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:30:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:30:49,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:30:49,612 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-21 02:30:51,633 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-21 02:30:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:30:52,100 INFO L93 Difference]: Finished difference Result 612 states and 909 transitions. [2022-07-21 02:30:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:30:52,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-21 02:30:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:30:52,103 INFO L225 Difference]: With dead ends: 612 [2022-07-21 02:30:52,103 INFO L226 Difference]: Without dead ends: 402 [2022-07-21 02:30:52,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:30:52,105 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:30:52,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 271 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 02:30:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-21 02:30:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 265. [2022-07-21 02:30:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:30:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2022-07-21 02:30:52,130 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 39 [2022-07-21 02:30:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:30:52,131 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2022-07-21 02:30:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-21 02:30:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2022-07-21 02:30:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 02:30:52,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:30:52,133 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, 1] [2022-07-21 02:30:52,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:30:52,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:30:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:30:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -228723188, now seen corresponding path program 1 times [2022-07-21 02:30:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:30:52,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963632675] [2022-07-21 02:30:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:30:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:30:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:30:52,350 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-21 02:30:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:30:52,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963632675] [2022-07-21 02:30:52,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963632675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:30:52,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:30:52,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:30:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871864140] [2022-07-21 02:30:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:30:52,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:30:52,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:30:52,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:30:52,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:30:52,354 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-21 02:30:54,365 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-21 02:30:56,378 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-21 02:30:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:30:56,659 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2022-07-21 02:30:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:30:56,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-21 02:30:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:30:56,662 INFO L225 Difference]: With dead ends: 431 [2022-07-21 02:30:56,662 INFO L226 Difference]: Without dead ends: 300 [2022-07-21 02:30:56,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:30:56,664 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:30:56,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 476 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-21 02:30:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-21 02:30:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2022-07-21 02:30:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5425531914893618) internal successors, (435), 282 states have internal predecessors, (435), 0 states have call successors, (0), 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-21 02:30:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2022-07-21 02:30:56,677 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 40 [2022-07-21 02:30:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:30:56,677 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2022-07-21 02:30:56,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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-21 02:30:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2022-07-21 02:30:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 02:30:56,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:30:56,680 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, 1, 1] [2022-07-21 02:30:56,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:30:56,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:30:56,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:30:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1727416149, now seen corresponding path program 1 times [2022-07-21 02:30:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:30:56,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118081302] [2022-07-21 02:30:56,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:30:56,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:30:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:30:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:30:56,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:30:56,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118081302] [2022-07-21 02:30:56,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118081302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:30:56,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:30:56,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:30:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71439617] [2022-07-21 02:30:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:30:56,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:30:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:30:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:30:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:30:56,864 INFO L87 Difference]: Start difference. First operand 283 states and 435 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:30:58,883 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-21 02:31:00,890 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-21 02:31:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:01,232 INFO L93 Difference]: Finished difference Result 758 states and 1164 transitions. [2022-07-21 02:31:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:01,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-21 02:31:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:01,235 INFO L225 Difference]: With dead ends: 758 [2022-07-21 02:31:01,235 INFO L226 Difference]: Without dead ends: 482 [2022-07-21 02:31:01,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:01,237 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 113 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:01,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 501 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-21 02:31:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-21 02:31:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 308. [2022-07-21 02:31:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.52442996742671) internal successors, (468), 307 states have internal predecessors, (468), 0 states have call successors, (0), 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-21 02:31:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 468 transitions. [2022-07-21 02:31:01,249 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 468 transitions. Word has length 55 [2022-07-21 02:31:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:01,250 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 468 transitions. [2022-07-21 02:31:01,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 468 transitions. [2022-07-21 02:31:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 02:31:01,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:01,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 02:31:01,253 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1149096951, now seen corresponding path program 1 times [2022-07-21 02:31:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:01,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572295978] [2022-07-21 02:31:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:31:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572295978] [2022-07-21 02:31:01,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572295978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:01,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:01,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89880042] [2022-07-21 02:31:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:01,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:01,460 INFO L87 Difference]: Start difference. First operand 308 states and 468 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:03,471 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-21 02:31:05,483 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-21 02:31:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:05,727 INFO L93 Difference]: Finished difference Result 484 states and 735 transitions. [2022-07-21 02:31:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:05,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-21 02:31:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:05,730 INFO L225 Difference]: With dead ends: 484 [2022-07-21 02:31:05,730 INFO L226 Difference]: Without dead ends: 324 [2022-07-21 02:31:05,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:05,731 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:05,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 474 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 02:31:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-21 02:31:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2022-07-21 02:31:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 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-21 02:31:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2022-07-21 02:31:05,746 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 55 [2022-07-21 02:31:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:05,747 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2022-07-21 02:31:05,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2022-07-21 02:31:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 02:31:05,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:05,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:05,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 02:31:05,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:05,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1382837768, now seen corresponding path program 1 times [2022-07-21 02:31:05,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:05,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438543067] [2022-07-21 02:31:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:05,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:31:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:05,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438543067] [2022-07-21 02:31:05,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438543067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:05,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:05,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979141886] [2022-07-21 02:31:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:05,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:05,964 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:07,981 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-21 02:31:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:08,328 INFO L93 Difference]: Finished difference Result 768 states and 1162 transitions. [2022-07-21 02:31:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:08,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-21 02:31:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:08,331 INFO L225 Difference]: With dead ends: 768 [2022-07-21 02:31:08,331 INFO L226 Difference]: Without dead ends: 470 [2022-07-21 02:31:08,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:08,332 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 292 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-21 02:31:08,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 292 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 02:31:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-21 02:31:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 312. [2022-07-21 02:31:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5112540192926045) internal successors, (470), 311 states have internal predecessors, (470), 0 states have call successors, (0), 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-21 02:31:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 470 transitions. [2022-07-21 02:31:08,343 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 470 transitions. Word has length 56 [2022-07-21 02:31:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:08,343 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 470 transitions. [2022-07-21 02:31:08,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 470 transitions. [2022-07-21 02:31:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 02:31:08,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:08,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:08,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 02:31:08,346 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 270979954, now seen corresponding path program 1 times [2022-07-21 02:31:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274900296] [2022-07-21 02:31:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:31:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:08,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274900296] [2022-07-21 02:31:08,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274900296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:08,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:08,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131343161] [2022-07-21 02:31:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:08,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:08,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:08,482 INFO L87 Difference]: Start difference. First operand 312 states and 470 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:10,492 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-21 02:31:12,506 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-21 02:31:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:12,726 INFO L93 Difference]: Finished difference Result 490 states and 737 transitions. [2022-07-21 02:31:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:12,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-21 02:31:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:12,728 INFO L225 Difference]: With dead ends: 490 [2022-07-21 02:31:12,728 INFO L226 Difference]: Without dead ends: 328 [2022-07-21 02:31:12,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:12,730 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:12,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 470 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 02:31:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-21 02:31:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 312. [2022-07-21 02:31:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5080385852090032) internal successors, (469), 311 states have internal predecessors, (469), 0 states have call successors, (0), 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-21 02:31:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 469 transitions. [2022-07-21 02:31:12,739 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 469 transitions. Word has length 57 [2022-07-21 02:31:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:12,740 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 469 transitions. [2022-07-21 02:31:12,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 469 transitions. [2022-07-21 02:31:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 02:31:12,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:12,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:12,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 02:31:12,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1460862829, now seen corresponding path program 1 times [2022-07-21 02:31:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:12,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570484436] [2022-07-21 02:31:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:31:12,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:12,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570484436] [2022-07-21 02:31:12,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570484436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:12,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:12,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162096488] [2022-07-21 02:31:12,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:12,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:12,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:12,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:12,866 INFO L87 Difference]: Start difference. First operand 312 states and 469 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:14,876 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-21 02:31:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:15,226 INFO L93 Difference]: Finished difference Result 772 states and 1158 transitions. [2022-07-21 02:31:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:15,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-21 02:31:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:15,228 INFO L225 Difference]: With dead ends: 772 [2022-07-21 02:31:15,228 INFO L226 Difference]: Without dead ends: 470 [2022-07-21 02:31:15,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:15,229 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:15,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 02:31:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-21 02:31:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 316. [2022-07-21 02:31:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4984126984126984) internal successors, (472), 315 states have internal predecessors, (472), 0 states have call successors, (0), 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-21 02:31:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2022-07-21 02:31:15,240 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 58 [2022-07-21 02:31:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:15,241 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2022-07-21 02:31:15,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2022-07-21 02:31:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 02:31:15,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:15,242 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, 1] [2022-07-21 02:31:15,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 02:31:15,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:15,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1518169684, now seen corresponding path program 1 times [2022-07-21 02:31:15,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:15,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95948201] [2022-07-21 02:31:15,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:15,358 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-21 02:31:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:15,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95948201] [2022-07-21 02:31:15,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95948201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:15,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:15,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:31:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145854915] [2022-07-21 02:31:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:15,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:31:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:15,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:31:15,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:31:15,361 INFO L87 Difference]: Start difference. First operand 316 states and 472 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-21 02:31:17,370 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-21 02:31:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:17,414 INFO L93 Difference]: Finished difference Result 641 states and 962 transitions. [2022-07-21 02:31:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:31:17,415 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 58 [2022-07-21 02:31:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:17,418 INFO L225 Difference]: With dead ends: 641 [2022-07-21 02:31:17,418 INFO L226 Difference]: Without dead ends: 477 [2022-07-21 02:31:17,419 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-21 02:31:17,419 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 474 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-21 02:31:17,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 02:31:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-21 02:31:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2022-07-21 02:31:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4915966386554622) internal successors, (710), 476 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 710 transitions. [2022-07-21 02:31:17,432 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 710 transitions. Word has length 58 [2022-07-21 02:31:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:17,433 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 710 transitions. [2022-07-21 02:31:17,433 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-21 02:31:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 710 transitions. [2022-07-21 02:31:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 02:31:17,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:17,434 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, 1] [2022-07-21 02:31:17,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 02:31:17,434 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:17,435 INFO L85 PathProgramCache]: Analyzing trace with hash -853569578, now seen corresponding path program 1 times [2022-07-21 02:31:17,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:17,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837902336] [2022-07-21 02:31:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:31:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:17,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837902336] [2022-07-21 02:31:17,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837902336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:17,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:17,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:31:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337558525] [2022-07-21 02:31:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:17,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:31:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:31:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:31:17,567 INFO L87 Difference]: Start difference. First operand 477 states and 710 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-21 02:31:19,576 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-21 02:31:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:19,638 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2022-07-21 02:31:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:31:19,639 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 58 [2022-07-21 02:31:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:19,641 INFO L225 Difference]: With dead ends: 826 [2022-07-21 02:31:19,641 INFO L226 Difference]: Without dead ends: 501 [2022-07-21 02:31:19,641 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-21 02:31:19,642 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:19,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 354 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 02:31:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-07-21 02:31:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-07-21 02:31:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.484) internal successors, (742), 500 states have internal predecessors, (742), 0 states have call successors, (0), 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-21 02:31:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 742 transitions. [2022-07-21 02:31:19,655 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 742 transitions. Word has length 58 [2022-07-21 02:31:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:19,655 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 742 transitions. [2022-07-21 02:31:19,655 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-21 02:31:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 742 transitions. [2022-07-21 02:31:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 02:31:19,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:19,657 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, 1] [2022-07-21 02:31:19,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 02:31:19,657 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -533479020, now seen corresponding path program 1 times [2022-07-21 02:31:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:19,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163847577] [2022-07-21 02:31:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 02:31:19,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163847577] [2022-07-21 02:31:19,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163847577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:19,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:19,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477723219] [2022-07-21 02:31:19,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:19,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:19,873 INFO L87 Difference]: Start difference. First operand 501 states and 742 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:21,886 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-21 02:31:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:22,220 INFO L93 Difference]: Finished difference Result 1297 states and 1926 transitions. [2022-07-21 02:31:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:22,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-21 02:31:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:22,224 INFO L225 Difference]: With dead ends: 1297 [2022-07-21 02:31:22,224 INFO L226 Difference]: Without dead ends: 806 [2022-07-21 02:31:22,225 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-21 02:31:22,226 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 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-21 02:31:22,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 02:31:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-07-21 02:31:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 579. [2022-07-21 02:31:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4965397923875432) internal successors, (865), 578 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-21 02:31:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 865 transitions. [2022-07-21 02:31:22,244 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 865 transitions. Word has length 78 [2022-07-21 02:31:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:22,244 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 865 transitions. [2022-07-21 02:31:22,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 865 transitions. [2022-07-21 02:31:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 02:31:22,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:22,246 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, 1] [2022-07-21 02:31:22,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 02:31:22,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash 360007318, now seen corresponding path program 1 times [2022-07-21 02:31:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570007508] [2022-07-21 02:31:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:22,388 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-21 02:31:22,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:22,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570007508] [2022-07-21 02:31:22,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570007508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:22,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:22,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:22,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338033403] [2022-07-21 02:31:22,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:22,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:22,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:22,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:22,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:22,391 INFO L87 Difference]: Start difference. First operand 579 states and 865 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-21 02:31:24,401 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-21 02:31:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:24,770 INFO L93 Difference]: Finished difference Result 1363 states and 2022 transitions. [2022-07-21 02:31:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:24,771 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 78 [2022-07-21 02:31:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:24,775 INFO L225 Difference]: With dead ends: 1363 [2022-07-21 02:31:24,775 INFO L226 Difference]: Without dead ends: 794 [2022-07-21 02:31:24,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:24,776 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:24,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 02:31:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-21 02:31:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 594. [2022-07-21 02:31:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 593 states have internal predecessors, (892), 0 states have call successors, (0), 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-21 02:31:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 892 transitions. [2022-07-21 02:31:24,793 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 892 transitions. Word has length 78 [2022-07-21 02:31:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:24,794 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 892 transitions. [2022-07-21 02:31:24,794 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-21 02:31:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 892 transitions. [2022-07-21 02:31:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 02:31:24,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:24,796 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, 1, 1] [2022-07-21 02:31:24,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 02:31:24,796 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1728932100, now seen corresponding path program 1 times [2022-07-21 02:31:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:24,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511535585] [2022-07-21 02:31:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:24,922 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-21 02:31:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:24,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511535585] [2022-07-21 02:31:24,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511535585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:24,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:24,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518261822] [2022-07-21 02:31:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:24,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:24,925 INFO L87 Difference]: Start difference. First operand 594 states and 892 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-21 02:31:26,939 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-21 02:31:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:27,304 INFO L93 Difference]: Finished difference Result 1453 states and 2163 transitions. [2022-07-21 02:31:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:27,305 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 79 [2022-07-21 02:31:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:27,309 INFO L225 Difference]: With dead ends: 1453 [2022-07-21 02:31:27,309 INFO L226 Difference]: Without dead ends: 869 [2022-07-21 02:31:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:27,311 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:27,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 02:31:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-21 02:31:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 672. [2022-07-21 02:31:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.5081967213114753) internal successors, (1012), 671 states have internal predecessors, (1012), 0 states have call successors, (0), 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-21 02:31:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1012 transitions. [2022-07-21 02:31:27,333 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1012 transitions. Word has length 79 [2022-07-21 02:31:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:27,333 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1012 transitions. [2022-07-21 02:31:27,333 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-21 02:31:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1012 transitions. [2022-07-21 02:31:27,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-21 02:31:27,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:27,335 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, 1, 1, 1] [2022-07-21 02:31:27,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 02:31:27,335 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2061764687, now seen corresponding path program 1 times [2022-07-21 02:31:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:27,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15499573] [2022-07-21 02:31:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:27,618 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-21 02:31:27,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:27,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15499573] [2022-07-21 02:31:27,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15499573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:27,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:27,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532143914] [2022-07-21 02:31:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:27,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:27,621 INFO L87 Difference]: Start difference. First operand 672 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 02:31:29,632 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-21 02:31:31,641 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-21 02:31:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:31,917 INFO L93 Difference]: Finished difference Result 1471 states and 2201 transitions. [2022-07-21 02:31:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-07-21 02:31:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:31,921 INFO L225 Difference]: With dead ends: 1471 [2022-07-21 02:31:31,922 INFO L226 Difference]: Without dead ends: 809 [2022-07-21 02:31:31,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:31,924 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:31,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 496 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-21 02:31:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-21 02:31:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-21 02:31:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5115332428765265) internal successors, (1114), 737 states have internal predecessors, (1114), 0 states have call successors, (0), 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-21 02:31:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2022-07-21 02:31:31,952 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 80 [2022-07-21 02:31:31,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:31,952 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2022-07-21 02:31:31,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 02:31:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2022-07-21 02:31:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 02:31:31,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:31,955 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:31,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 02:31:31,956 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash 793593224, now seen corresponding path program 1 times [2022-07-21 02:31:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:31,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894744121] [2022-07-21 02:31:31,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 02:31:32,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:32,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894744121] [2022-07-21 02:31:32,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894744121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:32,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:32,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083003036] [2022-07-21 02:31:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:32,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:32,114 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:34,124 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-21 02:31:36,136 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-21 02:31:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:36,372 INFO L93 Difference]: Finished difference Result 1537 states and 2300 transitions. [2022-07-21 02:31:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:36,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-21 02:31:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:36,376 INFO L225 Difference]: With dead ends: 1537 [2022-07-21 02:31:36,376 INFO L226 Difference]: Without dead ends: 809 [2022-07-21 02:31:36,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:36,378 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 48 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 496 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-21 02:31:36,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 496 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 02:31:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-21 02:31:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-21 02:31:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.507462686567164) internal successors, (1111), 737 states have internal predecessors, (1111), 0 states have call successors, (0), 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-21 02:31:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1111 transitions. [2022-07-21 02:31:36,396 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1111 transitions. Word has length 95 [2022-07-21 02:31:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:36,396 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1111 transitions. [2022-07-21 02:31:36,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1111 transitions. [2022-07-21 02:31:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 02:31:36,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:36,398 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:36,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 02:31:36,399 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1231158467, now seen corresponding path program 1 times [2022-07-21 02:31:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:36,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820807981] [2022-07-21 02:31:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 02:31:36,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:36,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820807981] [2022-07-21 02:31:36,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820807981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:36,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:36,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:36,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245124324] [2022-07-21 02:31:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:36,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:36,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:36,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:36,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:36,650 INFO L87 Difference]: Start difference. First operand 738 states and 1111 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-21 02:31:38,661 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-21 02:31:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:39,003 INFO L93 Difference]: Finished difference Result 1666 states and 2484 transitions. [2022-07-21 02:31:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:39,004 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 97 [2022-07-21 02:31:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:39,007 INFO L225 Difference]: With dead ends: 1666 [2022-07-21 02:31:39,007 INFO L226 Difference]: Without dead ends: 938 [2022-07-21 02:31:39,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:39,009 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:39,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 272 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 02:31:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-21 02:31:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 738. [2022-07-21 02:31:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4871099050203527) internal successors, (1096), 737 states have internal predecessors, (1096), 0 states have call successors, (0), 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-21 02:31:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1096 transitions. [2022-07-21 02:31:39,029 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1096 transitions. Word has length 97 [2022-07-21 02:31:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:39,029 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1096 transitions. [2022-07-21 02:31:39,029 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-21 02:31:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1096 transitions. [2022-07-21 02:31:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 02:31:39,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:39,031 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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-21 02:31:39,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 02:31:39,032 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1142724731, now seen corresponding path program 1 times [2022-07-21 02:31:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:39,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93727308] [2022-07-21 02:31:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 02:31:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:39,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93727308] [2022-07-21 02:31:39,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93727308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:39,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:39,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513969402] [2022-07-21 02:31:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:39,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:39,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:39,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:39,190 INFO L87 Difference]: Start difference. First operand 738 states and 1096 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-21 02:31:41,198 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-21 02:31:43,208 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-21 02:31:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:43,421 INFO L93 Difference]: Finished difference Result 1510 states and 2231 transitions. [2022-07-21 02:31:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:43,422 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 98 [2022-07-21 02:31:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:43,425 INFO L225 Difference]: With dead ends: 1510 [2022-07-21 02:31:43,425 INFO L226 Difference]: Without dead ends: 782 [2022-07-21 02:31:43,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:43,427 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:43,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 02:31:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-07-21 02:31:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 738. [2022-07-21 02:31:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4830393487109905) internal successors, (1093), 737 states have internal predecessors, (1093), 0 states have call successors, (0), 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-21 02:31:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1093 transitions. [2022-07-21 02:31:43,459 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1093 transitions. Word has length 98 [2022-07-21 02:31:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:43,459 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1093 transitions. [2022-07-21 02:31:43,460 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-21 02:31:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1093 transitions. [2022-07-21 02:31:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 02:31:43,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:43,462 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-21 02:31:43,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 02:31:43,462 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2022-07-21 02:31:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859706221] [2022-07-21 02:31:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:31:43,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:43,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859706221] [2022-07-21 02:31:43,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859706221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:43,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:43,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:31:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836673803] [2022-07-21 02:31:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:43,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:31:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:43,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:31:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:31:43,634 INFO L87 Difference]: Start difference. First operand 738 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:45,646 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-21 02:31:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:45,694 INFO L93 Difference]: Finished difference Result 1485 states and 2202 transitions. [2022-07-21 02:31:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:31:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-21 02:31:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:45,699 INFO L225 Difference]: With dead ends: 1485 [2022-07-21 02:31:45,699 INFO L226 Difference]: Without dead ends: 978 [2022-07-21 02:31:45,700 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-21 02:31:45,701 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:45,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 02:31:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-07-21 02:31:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2022-07-21 02:31:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.4820512820512821) internal successors, (1445), 975 states have internal predecessors, (1445), 0 states have call successors, (0), 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-21 02:31:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1445 transitions. [2022-07-21 02:31:45,726 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1445 transitions. Word has length 98 [2022-07-21 02:31:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:45,727 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1445 transitions. [2022-07-21 02:31:45,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1445 transitions. [2022-07-21 02:31:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 02:31:45,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:45,729 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-21 02:31:45,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 02:31:45,730 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2022-07-21 02:31:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:45,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938112638] [2022-07-21 02:31:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 02:31:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:45,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938112638] [2022-07-21 02:31:45,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938112638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:45,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:45,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:31:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794172953] [2022-07-21 02:31:45,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:31:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:45,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:31:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:31:45,889 INFO L87 Difference]: Start difference. First operand 976 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:47,897 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-21 02:31:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:47,948 INFO L93 Difference]: Finished difference Result 1695 states and 2507 transitions. [2022-07-21 02:31:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:31:47,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-21 02:31:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:47,952 INFO L225 Difference]: With dead ends: 1695 [2022-07-21 02:31:47,953 INFO L226 Difference]: Without dead ends: 950 [2022-07-21 02:31:47,954 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-21 02:31:47,954 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:47,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 472 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 02:31:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-21 02:31:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2022-07-21 02:31:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 1.4741833508956796) internal successors, (1399), 949 states have internal predecessors, (1399), 0 states have call successors, (0), 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-21 02:31:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1399 transitions. [2022-07-21 02:31:47,978 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1399 transitions. Word has length 98 [2022-07-21 02:31:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:47,979 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1399 transitions. [2022-07-21 02:31:47,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1399 transitions. [2022-07-21 02:31:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-21 02:31:47,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:47,981 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, 1, 1, 1] [2022-07-21 02:31:47,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 02:31:47,981 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -741144714, now seen corresponding path program 1 times [2022-07-21 02:31:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:47,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909683955] [2022-07-21 02:31:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:31:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:48,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909683955] [2022-07-21 02:31:48,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909683955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:48,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:48,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647484430] [2022-07-21 02:31:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:48,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:48,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:48,110 INFO L87 Difference]: Start difference. First operand 950 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:50,120 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-21 02:31:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:50,458 INFO L93 Difference]: Finished difference Result 2150 states and 3137 transitions. [2022-07-21 02:31:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:50,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-21 02:31:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:50,463 INFO L225 Difference]: With dead ends: 2150 [2022-07-21 02:31:50,463 INFO L226 Difference]: Without dead ends: 1210 [2022-07-21 02:31:50,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 02:31:50,466 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:50,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 278 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 02:31:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-07-21 02:31:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 958. [2022-07-21 02:31:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4743991640543366) internal successors, (1411), 957 states have internal predecessors, (1411), 0 states have call successors, (0), 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-21 02:31:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1411 transitions. [2022-07-21 02:31:50,492 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1411 transitions. Word has length 101 [2022-07-21 02:31:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:50,492 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1411 transitions. [2022-07-21 02:31:50,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1411 transitions. [2022-07-21 02:31:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 02:31:50,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:50,495 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:50,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 02:31:50,496 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-21 02:31:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:50,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566275992] [2022-07-21 02:31:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:31:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-21 02:31:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:31:50,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566275992] [2022-07-21 02:31:50,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566275992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:31:50,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:31:50,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:31:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699164676] [2022-07-21 02:31:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:31:50,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:31:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:31:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:31:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:31:50,841 INFO L87 Difference]: Start difference. First operand 958 states and 1411 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:52,851 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-21 02:31:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:31:53,032 INFO L93 Difference]: Finished difference Result 1907 states and 2808 transitions. [2022-07-21 02:31:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:31:53,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-21 02:31:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:31:53,036 INFO L225 Difference]: With dead ends: 1907 [2022-07-21 02:31:53,036 INFO L226 Difference]: Without dead ends: 959 [2022-07-21 02:31:53,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:31:53,038 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 7 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:31:53,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 02:31:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-21 02:31:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2022-07-21 02:31:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4733542319749215) internal successors, (1410), 957 states have internal predecessors, (1410), 0 states have call successors, (0), 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-21 02:31:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1410 transitions. [2022-07-21 02:31:53,061 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1410 transitions. Word has length 122 [2022-07-21 02:31:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:31:53,061 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1410 transitions. [2022-07-21 02:31:53,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:31:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1410 transitions. [2022-07-21 02:31:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-21 02:31:53,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:31:53,064 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:53,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 02:31:53,064 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:31:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:31:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-21 02:31:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:31:53,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566672565] [2022-07-21 02:31:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:31:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:31:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 02:31:53,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 02:31:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 02:31:54,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 02:31:54,093 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 02:31:54,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 02:31:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 02:31:54,102 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:31:54,106 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 02:31:54,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:31:54 BoogieIcfgContainer [2022-07-21 02:31:54,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 02:31:54,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 02:31:54,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 02:31:54,264 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 02:31:54,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:30:48" (3/4) ... [2022-07-21 02:31:54,267 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 02:31:54,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 02:31:54,268 INFO L158 Benchmark]: Toolchain (without parser) took 70060.01ms. Allocated memory was 54.5MB in the beginning and 188.7MB in the end (delta: 134.2MB). Free memory was 29.2MB in the beginning and 123.4MB in the end (delta: -94.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-07-21 02:31:54,268 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:31:54,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.32ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.0MB in the beginning and 44.2MB in the end (delta: -15.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-07-21 02:31:54,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.97ms. Allocated memory is still 67.1MB. Free memory was 44.2MB in the beginning and 39.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 02:31:54,269 INFO L158 Benchmark]: Boogie Preprocessor took 98.34ms. Allocated memory is still 67.1MB. Free memory was 39.4MB in the beginning and 32.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 02:31:54,269 INFO L158 Benchmark]: RCFGBuilder took 3152.93ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.6MB in the beginning and 36.2MB in the end (delta: -3.6MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2022-07-21 02:31:54,270 INFO L158 Benchmark]: TraceAbstraction took 66022.12ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 35.6MB in the beginning and 123.4MB in the end (delta: -87.8MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2022-07-21 02:31:54,270 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 188.7MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:31:54,271 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.16ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.32ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.0MB in the beginning and 44.2MB in the end (delta: -15.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.97ms. Allocated memory is still 67.1MB. Free memory was 44.2MB in the beginning and 39.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.34ms. Allocated memory is still 67.1MB. Free memory was 39.4MB in the beginning and 32.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3152.93ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.6MB in the beginning and 36.2MB in the end (delta: -3.6MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 66022.12ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 35.6MB in the beginning and 123.4MB in the end (delta: -87.8MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 188.7MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1658]: 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 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:14}, s->wbio={0:-9}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967315, (s->s3)->tmp.new_cipher={-10:0}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, 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___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1658] reach_error() VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.8s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 59.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 58.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1796 mSDsluCounter, 8169 SdHoareTripleChecker+Invalid, 57.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4463 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2881 IncrementalHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 3706 mSDtfsCounter, 2881 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=976occurred in iteration=18, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 1937 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 3445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 1288/1288 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-21 02:31:54,329 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/loops/s3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:31:56,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:31:56,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:31:56,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:31:56,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:31:56,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:31:56,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:31:56,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:31:56,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:31:56,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:31:56,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:31:56,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:31:56,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:31:56,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:31:56,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:31:56,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:31:56,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:31:56,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:31:56,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:31:56,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:31:56,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:31:56,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:31:56,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:31:56,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:31:56,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:31:56,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:31:56,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:31:56,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:31:56,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:31:56,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:31:56,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:31:56,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:31:56,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:31:56,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:31:56,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:31:56,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:31:56,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:31:56,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:31:56,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:31:56,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:31:56,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:31:56,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:31:56,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 02:31:56,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:31:56,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:31:56,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:31:56,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:31:56,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:31:56,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:31:56,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:31:56,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:31:56,394 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:31:56,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:31:56,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:31:56,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:31:56,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:31:56,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:31:56,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:31:56,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:31:56,396 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 02:31:56,397 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 02:31:56,397 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 02:31:56,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:31:56,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:31:56,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:31:56,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:31:56,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:31:56,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:31:56,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:31:56,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:31:56,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:31:56,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:31:56,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:31:56,400 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 02:31:56,400 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 02:31:56,400 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:31:56,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:31:56,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:31:56,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 02:31:56,401 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 -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-21 02:31:56,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:31:56,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:31:56,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:31:56,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:31:56,780 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:31:56,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-21 02:31:56,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e4924f8/29db7b4af7a546e8b142206d6fd310f6/FLAGaaf02c936 [2022-07-21 02:31:57,340 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:31:57,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-21 02:31:57,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e4924f8/29db7b4af7a546e8b142206d6fd310f6/FLAGaaf02c936 [2022-07-21 02:31:57,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e4924f8/29db7b4af7a546e8b142206d6fd310f6 [2022-07-21 02:31:57,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:31:57,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:31:57,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:31:57,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:31:57,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:31:57,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:31:57" (1/1) ... [2022-07-21 02:31:57,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59326ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:57, skipping insertion in model container [2022-07-21 02:31:57,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:31:57" (1/1) ... [2022-07-21 02:31:57,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:31:57,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:31:58,365 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/loops/s3.i[64167,64180] [2022-07-21 02:31:58,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:31:58,404 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 02:31:58,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:31:58,529 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/loops/s3.i[64167,64180] [2022-07-21 02:31:58,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:31:58,540 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:31:58,629 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/loops/s3.i[64167,64180] [2022-07-21 02:31:58,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:31:58,668 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:31:58,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58 WrapperNode [2022-07-21 02:31:58,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:31:58,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:31:58,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:31:58,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:31:58,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,742 INFO L137 Inliner]: procedures = 34, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 702 [2022-07-21 02:31:58,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:31:58,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:31:58,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:31:58,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:31:58,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:31:58,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:31:58,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:31:58,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:31:58,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (1/1) ... [2022-07-21 02:31:58,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:31:58,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:31:58,836 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-21 02:31:58,862 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-21 02:31:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:31:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 02:31:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:31:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 02:31:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:31:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:31:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:31:58,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:31:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 02:31:59,089 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:31:59,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:31:59,116 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 02:32:06,254 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-21 02:32:06,254 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-21 02:32:06,254 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:32:06,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:32:06,261 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 02:32:06,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:32:06 BoogieIcfgContainer [2022-07-21 02:32:06,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:32:06,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:32:06,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:32:06,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:32:06,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:31:57" (1/3) ... [2022-07-21 02:32:06,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286fab38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:32:06, skipping insertion in model container [2022-07-21 02:32:06,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:31:58" (2/3) ... [2022-07-21 02:32:06,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286fab38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:32:06, skipping insertion in model container [2022-07-21 02:32:06,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:32:06" (3/3) ... [2022-07-21 02:32:06,270 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-21 02:32:06,283 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:32:06,283 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:32:06,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:32:06,332 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@54ddd121, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b2c6fce [2022-07-21 02:32:06,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:32:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:32:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 02:32:06,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:06,347 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-21 02:32:06,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:06,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-21 02:32:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:06,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204888934] [2022-07-21 02:32:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:06,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:06,366 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-21 02:32:06,367 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-21 02:32:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:06,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 02:32:06,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:07,178 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-21 02:32:07,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:07,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:07,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204888934] [2022-07-21 02:32:07,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204888934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:07,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:07,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:32:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027507604] [2022-07-21 02:32:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:07,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:32:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:32:07,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:32:07,210 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-21 02:32:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:07,341 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-21 02:32:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:32:07,344 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-21 02:32:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:07,353 INFO L225 Difference]: With dead ends: 375 [2022-07-21 02:32:07,354 INFO L226 Difference]: Without dead ends: 217 [2022-07-21 02:32:07,357 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-21 02:32:07,359 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 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-21 02:32:07,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:32:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-21 02:32:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-21 02:32:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 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-21 02:32:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-21 02:32:07,405 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-21 02:32:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:07,405 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-21 02:32:07,405 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-21 02:32:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-21 02:32:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 02:32:07,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:07,408 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-21 02:32:07,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 02:32:07,629 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-21 02:32:07,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-21 02:32:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:07,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349095502] [2022-07-21 02:32:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:07,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:07,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:07,633 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-21 02:32:07,635 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-21 02:32:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:08,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 02:32:08,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:08,452 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-21 02:32:08,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:08,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349095502] [2022-07-21 02:32:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349095502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:08,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:08,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:32:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313526155] [2022-07-21 02:32:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:08,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:32:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:32:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:32:08,456 INFO L87 Difference]: Start difference. First operand 217 states and 321 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-21 02:32:10,486 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-21 02:32:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:10,622 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-07-21 02:32:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:32:10,622 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-21 02:32:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:10,625 INFO L225 Difference]: With dead ends: 426 [2022-07-21 02:32:10,625 INFO L226 Difference]: Without dead ends: 319 [2022-07-21 02:32:10,626 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-21 02:32:10,627 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 126 mSDsluCounter, 158 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-21 02:32:10,627 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-21 02:32:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-21 02:32:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-07-21 02:32:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4779874213836477) internal successors, (470), 318 states have internal predecessors, (470), 0 states have call successors, (0), 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-21 02:32:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-07-21 02:32:10,646 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-07-21 02:32:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:10,646 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-07-21 02:32:10,647 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-21 02:32:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-07-21 02:32:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 02:32:10,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:10,649 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-21 02:32:10,673 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-21 02:32:10,869 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-21 02:32:10,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-07-21 02:32:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:10,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371128927] [2022-07-21 02:32:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:10,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:10,875 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-21 02:32:10,877 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-21 02:32:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:11,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 02:32:11,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:11,651 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-21 02:32:11,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:11,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:11,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371128927] [2022-07-21 02:32:11,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371128927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:11,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:11,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:32:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300521592] [2022-07-21 02:32:11,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:11,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:32:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:32:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:32:11,654 INFO L87 Difference]: Start difference. First operand 319 states and 470 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-21 02:32:13,677 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-21 02:32:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:13,774 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-07-21 02:32:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:32:13,775 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-21 02:32:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:13,778 INFO L225 Difference]: With dead ends: 632 [2022-07-21 02:32:13,778 INFO L226 Difference]: Without dead ends: 423 [2022-07-21 02:32:13,779 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-21 02:32:13,780 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 474 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-21 02:32:13,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 02:32:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-21 02:32:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-07-21 02:32:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 0 states have call successors, (0), 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-21 02:32:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-07-21 02:32:13,801 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-07-21 02:32:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:13,802 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-07-21 02:32:13,802 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-21 02:32:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-07-21 02:32:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 02:32:13,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:13,806 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-21 02:32:13,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-21 02:32:14,027 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-21 02:32:14,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:14,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-07-21 02:32:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:14,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576286217] [2022-07-21 02:32:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:14,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:14,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:14,030 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-21 02:32:14,031 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-21 02:32:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:14,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 02:32:14,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:14,908 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-21 02:32:14,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:14,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:14,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576286217] [2022-07-21 02:32:14,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576286217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:14,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:14,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:32:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637367250] [2022-07-21 02:32:14,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:14,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:32:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:14,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:32:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:32:14,910 INFO L87 Difference]: Start difference. First operand 423 states and 622 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-21 02:32:16,929 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-21 02:32:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:17,036 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-07-21 02:32:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:32:17,038 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-21 02:32:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:17,040 INFO L225 Difference]: With dead ends: 839 [2022-07-21 02:32:17,040 INFO L226 Difference]: Without dead ends: 526 [2022-07-21 02:32:17,042 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-21 02:32:17,043 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 473 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-21 02:32:17,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 02:32:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-21 02:32:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-07-21 02:32:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4723809523809523) internal successors, (773), 525 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:32:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-07-21 02:32:17,079 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-07-21 02:32:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:17,079 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-07-21 02:32:17,079 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-21 02:32:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-07-21 02:32:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 02:32:17,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:17,093 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-21 02:32:17,120 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-21 02:32:17,293 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-21 02:32:17,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-07-21 02:32:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:17,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363785337] [2022-07-21 02:32:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:17,301 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-21 02:32:17,303 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-21 02:32:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:17,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 02:32:17,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:32:18,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:18,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:18,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363785337] [2022-07-21 02:32:18,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363785337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:18,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:18,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:32:18,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918216855] [2022-07-21 02:32:18,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:18,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:32:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:32:18,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:32:18,177 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:32:20,196 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-21 02:32:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:20,291 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-07-21 02:32:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:32:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-21 02:32:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:20,295 INFO L225 Difference]: With dead ends: 939 [2022-07-21 02:32:20,295 INFO L226 Difference]: Without dead ends: 523 [2022-07-21 02:32:20,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-21 02:32:20,297 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:32:20,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 02:32:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-21 02:32:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-21 02:32:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4616858237547892) internal successors, (763), 522 states have internal predecessors, (763), 0 states have call successors, (0), 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-21 02:32:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-07-21 02:32:20,312 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-07-21 02:32:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:20,312 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-07-21 02:32:20,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:32:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-07-21 02:32:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 02:32:20,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:20,315 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, 1, 1] [2022-07-21 02:32:20,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 02:32:20,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:32:20,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-07-21 02:32:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:20,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76782589] [2022-07-21 02:32:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:20,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:20,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:20,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:32:20,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 02:32:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:21,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 02:32:21,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:21,892 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-21 02:32:21,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-21 02:32:22,188 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-21 02:32:22,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-21 02:32:22,345 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:32:22,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-21 02:32:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 02:32:22,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:22,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:22,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76782589] [2022-07-21 02:32:22,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76782589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:22,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:22,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:32:22,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165171705] [2022-07-21 02:32:22,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:22,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:32:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:32:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:32:22,397 INFO L87 Difference]: Start difference. First operand 523 states and 763 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:32:24,428 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-21 02:32:31,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:32:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:31,465 INFO L93 Difference]: Finished difference Result 1191 states and 1739 transitions. [2022-07-21 02:32:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:32:31,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-21 02:32:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:31,471 INFO L225 Difference]: With dead ends: 1191 [2022-07-21 02:32:31,471 INFO L226 Difference]: Without dead ends: 675 [2022-07-21 02:32:31,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:32:31,473 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:32:31,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 1 Unknown, 30 Unchecked, 9.0s Time] [2022-07-21 02:32:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-07-21 02:32:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 607. [2022-07-21 02:32:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.49009900990099) internal successors, (903), 606 states have internal predecessors, (903), 0 states have call successors, (0), 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-21 02:32:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 903 transitions. [2022-07-21 02:32:31,497 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 903 transitions. Word has length 100 [2022-07-21 02:32:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:31,498 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 903 transitions. [2022-07-21 02:32:31,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:32:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 903 transitions. [2022-07-21 02:32:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 02:32:31,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:31,500 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, 1, 1] [2022-07-21 02:32:31,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 02:32:31,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:32:31,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2022-07-21 02:32:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:31,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770740976] [2022-07-21 02:32:31,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:31,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:31,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:31,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:32:31,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 02:32:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:33,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 02:32:33,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:33,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:32:33,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:32:33,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:32:33,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:32:33,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:32:33,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:32:33,898 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-21 02:32:33,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-21 02:32:34,770 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:32:34,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-21 02:32:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:32:34,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:34,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770740976] [2022-07-21 02:32:34,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770740976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:34,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:34,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:32:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304517643] [2022-07-21 02:32:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:34,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:32:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:32:34,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:32:34,808 INFO L87 Difference]: Start difference. First operand 607 states and 903 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-21 02:32:36,839 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-21 02:32:38,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:32:46,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:32:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:47,926 INFO L93 Difference]: Finished difference Result 1413 states and 2092 transitions. [2022-07-21 02:32:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:32:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-21 02:32:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:47,941 INFO L225 Difference]: With dead ends: 1413 [2022-07-21 02:32:47,942 INFO L226 Difference]: Without dead ends: 813 [2022-07-21 02:32:47,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:32:47,944 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 46 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:32:47,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 508 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2022-07-21 02:32:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-21 02:32:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 703. [2022-07-21 02:32:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 1.5256410256410255) internal successors, (1071), 702 states have internal predecessors, (1071), 0 states have call successors, (0), 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-21 02:32:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1071 transitions. [2022-07-21 02:32:47,969 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1071 transitions. Word has length 100 [2022-07-21 02:32:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:47,970 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1071 transitions. [2022-07-21 02:32:47,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-21 02:32:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1071 transitions. [2022-07-21 02:32:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 02:32:47,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:47,972 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, 1, 1, 1] [2022-07-21 02:32:48,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 02:32:48,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:32:48,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2022-07-21 02:32:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:48,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378122859] [2022-07-21 02:32:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:48,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:48,194 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:32:48,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 02:32:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:32:50,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:32:50,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:32:51,373 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-21 02:32:51,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:32:51,457 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:32:51,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:32:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:32:51,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:32:51,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:32:51,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378122859] [2022-07-21 02:32:51,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378122859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:32:51,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:32:51,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:32:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925886858] [2022-07-21 02:32:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:32:51,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:32:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:32:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:32:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:32:51,505 INFO L87 Difference]: Start difference. First operand 703 states and 1071 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-21 02:32:53,535 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-21 02:32:55,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:32:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:32:58,705 INFO L93 Difference]: Finished difference Result 1464 states and 2226 transitions. [2022-07-21 02:32:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:32:58,708 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 115 [2022-07-21 02:32:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:32:58,712 INFO L225 Difference]: With dead ends: 1464 [2022-07-21 02:32:58,712 INFO L226 Difference]: Without dead ends: 768 [2022-07-21 02:32:58,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:32:58,714 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:32:58,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 1 Unknown, 15 Unchecked, 7.1s Time] [2022-07-21 02:32:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-07-21 02:32:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2022-07-21 02:32:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.5032594524119949) internal successors, (1153), 767 states have internal predecessors, (1153), 0 states have call successors, (0), 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-21 02:32:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1153 transitions. [2022-07-21 02:32:58,745 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1153 transitions. Word has length 115 [2022-07-21 02:32:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:32:58,746 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1153 transitions. [2022-07-21 02:32:58,746 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-21 02:32:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1153 transitions. [2022-07-21 02:32:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 02:32:58,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:32:58,749 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:32:58,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:32:58,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:32:58,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:32:58,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:32:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2022-07-21 02:32:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:32:58,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069379901] [2022-07-21 02:32:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:32:58,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:32:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:32:58,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:32:58,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 02:33:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:33:00,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:33:00,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:33:01,277 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-21 02:33:01,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:33:01,367 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:33:01,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:33:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:33:01,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:33:01,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:33:01,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069379901] [2022-07-21 02:33:01,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069379901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:33:01,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:33:01,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:33:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131884717] [2022-07-21 02:33:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:33:01,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:33:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:33:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:33:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:33:01,412 INFO L87 Difference]: Start difference. First operand 768 states and 1153 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-21 02:33:03,447 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-21 02:33:06,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:08,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:33:09,855 INFO L93 Difference]: Finished difference Result 1534 states and 2305 transitions. [2022-07-21 02:33:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:33:09,859 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 115 [2022-07-21 02:33:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:33:09,862 INFO L225 Difference]: With dead ends: 1534 [2022-07-21 02:33:09,862 INFO L226 Difference]: Without dead ends: 773 [2022-07-21 02:33:09,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:33:09,866 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:33:09,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 2 Unknown, 18 Unchecked, 8.4s Time] [2022-07-21 02:33:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-21 02:33:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2022-07-21 02:33:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4896373056994818) internal successors, (1150), 772 states have internal predecessors, (1150), 0 states have call successors, (0), 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-21 02:33:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1150 transitions. [2022-07-21 02:33:09,890 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1150 transitions. Word has length 115 [2022-07-21 02:33:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:33:09,890 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1150 transitions. [2022-07-21 02:33:09,890 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-21 02:33:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1150 transitions. [2022-07-21 02:33:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 02:33:09,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:33:09,893 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2022-07-21 02:33:09,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:33:10,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:33:10,118 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:33:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:33:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash -647023955, now seen corresponding path program 1 times [2022-07-21 02:33:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:33:10,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547282045] [2022-07-21 02:33:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:33:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:33:10,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:33:10,124 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:33:10,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 02:33:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:33:11,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:33:11,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:33:12,178 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-21 02:33:12,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:33:12,299 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:33:12,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:33:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:33:12,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:33:12,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:33:12,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547282045] [2022-07-21 02:33:12,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547282045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:33:12,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:33:12,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:33:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892615687] [2022-07-21 02:33:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:33:12,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:33:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:33:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:33:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:33:12,338 INFO L87 Difference]: Start difference. First operand 773 states and 1150 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-21 02:33:14,362 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-21 02:33:15,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:17,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:19,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:21,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:22,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:23,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:33:23,877 INFO L93 Difference]: Finished difference Result 1415 states and 2093 transitions. [2022-07-21 02:33:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:33:23,880 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 115 [2022-07-21 02:33:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:33:23,884 INFO L225 Difference]: With dead ends: 1415 [2022-07-21 02:33:23,884 INFO L226 Difference]: Without dead ends: 809 [2022-07-21 02:33:23,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:33:23,886 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:33:23,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 460 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 1 Unknown, 19 Unchecked, 11.5s Time] [2022-07-21 02:33:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-21 02:33:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 773. [2022-07-21 02:33:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4844559585492227) internal successors, (1146), 772 states have internal predecessors, (1146), 0 states have call successors, (0), 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-21 02:33:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1146 transitions. [2022-07-21 02:33:23,913 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1146 transitions. Word has length 115 [2022-07-21 02:33:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:33:23,914 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1146 transitions. [2022-07-21 02:33:23,914 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-21 02:33:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1146 transitions. [2022-07-21 02:33:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 02:33:23,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:33:23,916 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:33:23,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 02:33:24,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:33:24,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:33:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:33:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2022-07-21 02:33:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:33:24,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059665796] [2022-07-21 02:33:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:33:24,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:33:24,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:33:24,134 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:33:24,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 02:33:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:33:26,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:33:26,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:33:27,235 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-21 02:33:27,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:33:27,336 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:33:27,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:33:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:33:27,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:33:27,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:33:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059665796] [2022-07-21 02:33:27,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059665796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:33:27,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:33:27,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:33:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662628363] [2022-07-21 02:33:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:33:27,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:33:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:33:27,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:33:27,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:33:27,380 INFO L87 Difference]: Start difference. First operand 773 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:33:29,413 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-21 02:33:31,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:34,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:33:34,567 INFO L93 Difference]: Finished difference Result 1544 states and 2291 transitions. [2022-07-21 02:33:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:33:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-07-21 02:33:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:33:34,572 INFO L225 Difference]: With dead ends: 1544 [2022-07-21 02:33:34,572 INFO L226 Difference]: Without dead ends: 778 [2022-07-21 02:33:34,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:33:34,574 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:33:34,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 81 Invalid, 1 Unknown, 17 Unchecked, 7.1s Time] [2022-07-21 02:33:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-21 02:33:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-07-21 02:33:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.471042471042471) internal successors, (1143), 777 states have internal predecessors, (1143), 0 states have call successors, (0), 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-21 02:33:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1143 transitions. [2022-07-21 02:33:34,608 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1143 transitions. Word has length 116 [2022-07-21 02:33:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:33:34,608 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1143 transitions. [2022-07-21 02:33:34,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:33:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1143 transitions. [2022-07-21 02:33:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 02:33:34,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:33:34,611 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2022-07-21 02:33:34,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-21 02:33:34,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:33:34,827 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:33:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:33:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash -710278962, now seen corresponding path program 1 times [2022-07-21 02:33:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:33:34,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570557245] [2022-07-21 02:33:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:33:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:33:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:33:34,830 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:33:34,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 02:33:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:33:36,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:33:36,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:33:36,895 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-21 02:33:36,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:33:37,023 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:33:37,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:33:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:33:37,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:33:37,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:33:37,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570557245] [2022-07-21 02:33:37,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570557245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:33:37,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:33:37,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:33:37,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103329427] [2022-07-21 02:33:37,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:33:37,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:33:37,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:33:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:33:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:33:37,064 INFO L87 Difference]: Start difference. First operand 778 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:33:39,090 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-21 02:33:41,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:33:46,142 INFO L93 Difference]: Finished difference Result 1424 states and 2081 transitions. [2022-07-21 02:33:46,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:33:46,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-07-21 02:33:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:33:46,148 INFO L225 Difference]: With dead ends: 1424 [2022-07-21 02:33:46,148 INFO L226 Difference]: Without dead ends: 814 [2022-07-21 02:33:46,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:33:46,149 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:33:46,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 458 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 1 Unknown, 20 Unchecked, 9.0s Time] [2022-07-21 02:33:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-07-21 02:33:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 778. [2022-07-21 02:33:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.465894465894466) internal successors, (1139), 777 states have internal predecessors, (1139), 0 states have call successors, (0), 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-21 02:33:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1139 transitions. [2022-07-21 02:33:46,183 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1139 transitions. Word has length 116 [2022-07-21 02:33:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:33:46,184 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1139 transitions. [2022-07-21 02:33:46,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:33:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1139 transitions. [2022-07-21 02:33:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 02:33:46,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:33:46,187 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:33:46,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 02:33:46,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:33:46,400 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:33:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:33:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2022-07-21 02:33:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:33:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083060031] [2022-07-21 02:33:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:33:46,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:33:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:33:46,403 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:33:46,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 02:33:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:33:48,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:33:48,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:33:48,867 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-21 02:33:48,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:33:48,976 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:33:48,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:33:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:33:49,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:33:49,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:33:49,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083060031] [2022-07-21 02:33:49,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083060031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:33:49,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:33:49,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:33:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132817118] [2022-07-21 02:33:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:33:49,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:33:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:33:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:33:49,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:33:49,022 INFO L87 Difference]: Start difference. First operand 778 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:33:51,051 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-21 02:33:52,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:54,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:33:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:33:56,491 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-21 02:33:56,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:33:56,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-21 02:33:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:33:56,497 INFO L225 Difference]: With dead ends: 1554 [2022-07-21 02:33:56,498 INFO L226 Difference]: Without dead ends: 783 [2022-07-21 02:33:56,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:33:56,500 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:33:56,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 1 Unknown, 19 Unchecked, 7.4s Time] [2022-07-21 02:33:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-07-21 02:33:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2022-07-21 02:33:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4526854219948848) internal successors, (1136), 782 states have internal predecessors, (1136), 0 states have call successors, (0), 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-21 02:33:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1136 transitions. [2022-07-21 02:33:56,528 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1136 transitions. Word has length 117 [2022-07-21 02:33:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:33:56,528 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1136 transitions. [2022-07-21 02:33:56,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:33:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1136 transitions. [2022-07-21 02:33:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 02:33:56,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:33:56,531 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:33:56,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 02:33:56,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:33:56,747 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:33:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:33:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2022-07-21 02:33:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:33:56,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300834572] [2022-07-21 02:33:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:33:56,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:33:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:33:56,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:33:56,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 02:33:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:33:58,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:33:58,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:33:59,215 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-21 02:33:59,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:33:59,354 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:33:59,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:33:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:33:59,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:33:59,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:33:59,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300834572] [2022-07-21 02:33:59,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300834572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:33:59,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:33:59,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:33:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047287312] [2022-07-21 02:33:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:33:59,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:33:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:33:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:33:59,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:33:59,395 INFO L87 Difference]: Start difference. First operand 783 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:01,424 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-21 02:34:02,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:34:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:34:05,891 INFO L93 Difference]: Finished difference Result 1564 states and 2271 transitions. [2022-07-21 02:34:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:34:05,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-21 02:34:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:34:05,898 INFO L225 Difference]: With dead ends: 1564 [2022-07-21 02:34:05,899 INFO L226 Difference]: Without dead ends: 788 [2022-07-21 02:34:05,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:34:05,901 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:34:05,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 1 Unknown, 21 Unchecked, 6.4s Time] [2022-07-21 02:34:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-21 02:34:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-21 02:34:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4396442185514613) internal successors, (1133), 787 states have internal predecessors, (1133), 0 states have call successors, (0), 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-21 02:34:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1133 transitions. [2022-07-21 02:34:05,924 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1133 transitions. Word has length 118 [2022-07-21 02:34:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:34:05,924 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1133 transitions. [2022-07-21 02:34:05,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1133 transitions. [2022-07-21 02:34:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 02:34:05,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:34:05,927 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-07-21 02:34:05,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 02:34:06,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:34:06,148 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:34:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:34:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2022-07-21 02:34:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:34:06,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550881425] [2022-07-21 02:34:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:34:06,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:34:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:34:06,151 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:34:06,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 02:34:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:34:08,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:34:08,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:34:08,982 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-21 02:34:08,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:34:09,159 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:34:09,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:34:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:34:09,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:34:09,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:34:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550881425] [2022-07-21 02:34:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550881425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:34:09,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:34:09,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:34:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258511552] [2022-07-21 02:34:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:34:09,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:34:09,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:34:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:34:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:34:09,200 INFO L87 Difference]: Start difference. First operand 788 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:11,226 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-21 02:34:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:34:16,640 INFO L93 Difference]: Finished difference Result 1569 states and 2255 transitions. [2022-07-21 02:34:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:34:16,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-21 02:34:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:34:16,646 INFO L225 Difference]: With dead ends: 1569 [2022-07-21 02:34:16,646 INFO L226 Difference]: Without dead ends: 788 [2022-07-21 02:34:16,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:34:16,649 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:34:16,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 18 Unchecked, 7.4s Time] [2022-07-21 02:34:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-21 02:34:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-21 02:34:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.434561626429479) internal successors, (1129), 787 states have internal predecessors, (1129), 0 states have call successors, (0), 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-21 02:34:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1129 transitions. [2022-07-21 02:34:16,672 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1129 transitions. Word has length 118 [2022-07-21 02:34:16,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:34:16,673 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1129 transitions. [2022-07-21 02:34:16,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1129 transitions. [2022-07-21 02:34:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 02:34:16,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:34:16,676 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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-21 02:34:16,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 02:34:16,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:34:16,896 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:34:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:34:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1781105215, now seen corresponding path program 1 times [2022-07-21 02:34:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:34:16,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974707075] [2022-07-21 02:34:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:34:16,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:34:16,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:34:16,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:34:16,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 02:34:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:34:19,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:34:19,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:34:19,624 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-21 02:34:19,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:34:19,786 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:34:19,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:34:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:34:19,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:34:19,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:34:19,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974707075] [2022-07-21 02:34:19,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974707075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:34:19,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:34:19,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:34:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243794640] [2022-07-21 02:34:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:34:19,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:34:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:34:19,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:34:19,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:34:19,833 INFO L87 Difference]: Start difference. First operand 788 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:21,899 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-21 02:34:23,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:34:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:34:26,499 INFO L93 Difference]: Finished difference Result 1583 states and 2264 transitions. [2022-07-21 02:34:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:34:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-21 02:34:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:34:26,505 INFO L225 Difference]: With dead ends: 1583 [2022-07-21 02:34:26,505 INFO L226 Difference]: Without dead ends: 802 [2022-07-21 02:34:26,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:34:26,506 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 02:34:26,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 1 Unknown, 22 Unchecked, 6.6s Time] [2022-07-21 02:34:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-21 02:34:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-21 02:34:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4294790343074968) internal successors, (1125), 787 states have internal predecessors, (1125), 0 states have call successors, (0), 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-21 02:34:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1125 transitions. [2022-07-21 02:34:26,526 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1125 transitions. Word has length 118 [2022-07-21 02:34:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:34:26,527 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1125 transitions. [2022-07-21 02:34:26,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1125 transitions. [2022-07-21 02:34:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-21 02:34:26,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:34:26,529 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:34:26,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 02:34:26,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:34:26,744 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:34:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:34:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1012937024, now seen corresponding path program 1 times [2022-07-21 02:34:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:34:26,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307508181] [2022-07-21 02:34:26,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:34:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:34:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:34:26,746 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:34:26,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 02:34:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:34:28,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:34:28,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:34:29,239 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-21 02:34:29,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:34:29,394 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:34:29,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:34:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:34:29,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:34:29,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:34:29,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307508181] [2022-07-21 02:34:29,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307508181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:34:29,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:34:29,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:34:29,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475744732] [2022-07-21 02:34:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:34:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:34:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:34:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:34:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:34:29,431 INFO L87 Difference]: Start difference. First operand 788 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:31,455 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-21 02:34:34,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 02:34:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:34:35,571 INFO L93 Difference]: Finished difference Result 1583 states and 2256 transitions. [2022-07-21 02:34:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:34:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-07-21 02:34:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:34:35,576 INFO L225 Difference]: With dead ends: 1583 [2022-07-21 02:34:35,576 INFO L226 Difference]: Without dead ends: 802 [2022-07-21 02:34:35,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:34:35,578 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:34:35,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 24 Unchecked, 6.1s Time] [2022-07-21 02:34:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-21 02:34:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-21 02:34:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4243964421855146) internal successors, (1121), 787 states have internal predecessors, (1121), 0 states have call successors, (0), 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-21 02:34:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1121 transitions. [2022-07-21 02:34:35,616 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1121 transitions. Word has length 119 [2022-07-21 02:34:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:34:35,616 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1121 transitions. [2022-07-21 02:34:35,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1121 transitions. [2022-07-21 02:34:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-21 02:34:35,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:34:35,618 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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-21 02:34:35,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 02:34:35,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:34:35,819 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:34:35,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:34:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 405159276, now seen corresponding path program 1 times [2022-07-21 02:34:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:34:35,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696715116] [2022-07-21 02:34:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:34:35,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:34:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:34:35,822 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:34:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 02:34:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:34:37,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:34:37,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:34:38,203 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-21 02:34:38,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-21 02:34:38,357 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-21 02:34:38,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-21 02:34:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 02:34:38,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:34:38,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:34:38,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696715116] [2022-07-21 02:34:38,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696715116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:34:38,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:34:38,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:34:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5412767] [2022-07-21 02:34:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:34:38,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:34:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:34:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:34:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:34:38,405 INFO L87 Difference]: Start difference. First operand 788 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:40,432 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-21 02:34:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:34:45,245 INFO L93 Difference]: Finished difference Result 1569 states and 2231 transitions. [2022-07-21 02:34:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:34:45,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-07-21 02:34:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:34:45,250 INFO L225 Difference]: With dead ends: 1569 [2022-07-21 02:34:45,251 INFO L226 Difference]: Without dead ends: 788 [2022-07-21 02:34:45,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:34:45,252 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:34:45,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 1 Unknown, 18 Unchecked, 6.8s Time] [2022-07-21 02:34:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-21 02:34:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-21 02:34:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4193138500635325) internal successors, (1117), 787 states have internal predecessors, (1117), 0 states have call successors, (0), 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-21 02:34:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1117 transitions. [2022-07-21 02:34:45,270 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1117 transitions. Word has length 119 [2022-07-21 02:34:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:34:45,270 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1117 transitions. [2022-07-21 02:34:45,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:34:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1117 transitions. [2022-07-21 02:34:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 02:34:45,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:34:45,272 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:34:45,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 02:34:45,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:34:45,492 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:34:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:34:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-21 02:34:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:34:45,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489122917] [2022-07-21 02:34:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:34:45,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:34:45,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:34:45,494 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:34:45,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 02:34:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:34:48,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 02:34:48,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:34:48,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:34:48,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:48,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-21 02:34:50,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:50,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:34:51,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:34:51,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-21 02:34:51,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:34:51,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-21 02:34:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-21 02:34:51,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:34:51,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:34:51,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489122917] [2022-07-21 02:34:51,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489122917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:34:51,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:34:51,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:34:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319487250] [2022-07-21 02:34:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:34:51,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:34:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:34:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:34:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:34:51,719 INFO L87 Difference]: Start difference. First operand 788 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-21 02:34:53,741 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-21 02:34:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:34:53,802 INFO L93 Difference]: Finished difference Result 1419 states and 2013 transitions. [2022-07-21 02:34:53,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:34:53,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-21 02:34:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:34:53,806 INFO L225 Difference]: With dead ends: 1419 [2022-07-21 02:34:53,806 INFO L226 Difference]: Without dead ends: 801 [2022-07-21 02:34:53,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:34:53,807 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 8 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:34:53,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.1s Time] [2022-07-21 02:34:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-07-21 02:34:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2022-07-21 02:34:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4223057644110275) internal successors, (1135), 798 states have internal predecessors, (1135), 0 states have call successors, (0), 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-21 02:34:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1135 transitions. [2022-07-21 02:34:53,829 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1135 transitions. Word has length 122 [2022-07-21 02:34:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:34:53,829 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1135 transitions. [2022-07-21 02:34:53,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-21 02:34:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1135 transitions. [2022-07-21 02:34:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-21 02:34:53,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:34:53,832 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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]