./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 6c24879c 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-?-6c24879 [2022-07-12 03:47:57,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:47:57,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:47:57,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:47:57,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:47:57,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:47:57,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:47:57,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:47:57,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:47:57,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:47:57,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:47:57,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:47:57,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:47:57,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:47:57,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:47:57,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:47:57,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:47:57,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:47:57,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:47:57,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:47:57,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:47:57,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:47:57,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:47:57,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:47:57,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:47:57,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:47:57,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:47:57,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:47:57,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:47:57,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:47:57,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:47:57,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:47:57,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:47:57,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:47:57,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:47:57,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:47:57,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:47:57,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:47:57,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:47:57,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:47:57,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:47:57,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:47:57,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:47:57,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:47:57,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:47:57,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:47:57,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:47:57,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:47:57,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:47:57,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:47:57,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:47:57,512 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:47:57,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:47:57,513 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:47:57,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:47:57,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:47:57,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:47:57,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:47:57,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:47:57,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:47:57,514 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:47:57,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:47:57,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:47:57,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:47:57,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:47:57,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:47:57,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:47:57,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:47:57,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:47:57,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:47:57,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:47:57,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:47:57,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:47:57,516 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:47:57,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:47:57,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:47:57,517 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-12 03:47:57,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:47:57,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:47:57,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:47:57,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:47:57,724 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:47:57,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-12 03:47:57,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/709e0e9d8/ce9b48c6632c47b886d71fffe0a521e6/FLAGa7f1c0d50 [2022-07-12 03:47:58,119 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:47:58,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-12 03:47:58,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/709e0e9d8/ce9b48c6632c47b886d71fffe0a521e6/FLAGa7f1c0d50 [2022-07-12 03:47:58,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/709e0e9d8/ce9b48c6632c47b886d71fffe0a521e6 [2022-07-12 03:47:58,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:47:58,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:47:58,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:47:58,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:47:58,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:47:58,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:58,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20dd36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58, skipping insertion in model container [2022-07-12 03:47:58,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:58,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:47:58,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:47:58,868 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-12 03:47:58,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:47:58,882 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:47:58,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i[64167,64180] [2022-07-12 03:47:58,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:47:58,997 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:47:58,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58 WrapperNode [2022-07-12 03:47:58,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:47:58,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:47:58,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:47:58,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:47:59,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,068 INFO L137 Inliner]: procedures = 30, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 732 [2022-07-12 03:47:59,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:47:59,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:47:59,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:47:59,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:47:59,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:47:59,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:47:59,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:47:59,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:47:59,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (1/1) ... [2022-07-12 03:47:59,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:47:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:47:59,167 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-12 03:47:59,182 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-12 03:47:59,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:47:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:47:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:47:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:47:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:47:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:47:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:47:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:47:59,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:47:59,363 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:47:59,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:47:59,373 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 03:48:02,042 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-12 03:48:02,042 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-12 03:48:02,043 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:48:02,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:48:02,052 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 03:48:02,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:02 BoogieIcfgContainer [2022-07-12 03:48:02,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:48:02,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:48:02,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:48:02,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:48:02,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:47:58" (1/3) ... [2022-07-12 03:48:02,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f449142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:48:02, skipping insertion in model container [2022-07-12 03:48:02,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:47:58" (2/3) ... [2022-07-12 03:48:02,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f449142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:48:02, skipping insertion in model container [2022-07-12 03:48:02,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:02" (3/3) ... [2022-07-12 03:48:02,073 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-12 03:48:02,085 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:48:02,086 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:48:02,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:48:02,142 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@6ed3dad6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@167184b4 [2022-07-12 03:48:02,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:48:02,148 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-12 03:48:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:48:02,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:02,155 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-12 03:48:02,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-12 03:48:02,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:02,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953616370] [2022-07-12 03:48:02,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:02,655 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-12 03:48:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953616370] [2022-07-12 03:48:02,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953616370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:02,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:02,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:48:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433710996] [2022-07-12 03:48:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:02,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:48:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:48:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:02,699 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-12 03:48:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:02,786 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-12 03:48:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:48:02,797 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-12 03:48:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:02,805 INFO L225 Difference]: With dead ends: 375 [2022-07-12 03:48:02,806 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 03:48:02,811 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-12 03:48:02,814 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:02,815 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.0s Time] [2022-07-12 03:48:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 03:48:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-12 03:48:02,862 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-12 03:48:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-12 03:48:02,867 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-12 03:48:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:02,867 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-12 03:48:02,868 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-12 03:48:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-12 03:48:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 03:48:02,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:02,870 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-12 03:48:02,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:48:02,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:02,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-12 03:48:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:02,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991669313] [2022-07-12 03:48:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:03,129 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-12 03:48:03,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:03,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991669313] [2022-07-12 03:48:03,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991669313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:03,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:03,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882598022] [2022-07-12 03:48:03,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:03,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:03,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:03,134 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-12 03:48:05,155 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-12 03:48:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:05,518 INFO L93 Difference]: Finished difference Result 612 states and 909 transitions. [2022-07-12 03:48:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:05,519 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-12 03:48:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:05,521 INFO L225 Difference]: With dead ends: 612 [2022-07-12 03:48:05,521 INFO L226 Difference]: Without dead ends: 402 [2022-07-12 03:48:05,522 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-12 03:48:05,523 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:05,524 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.3s Time] [2022-07-12 03:48:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-12 03:48:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 265. [2022-07-12 03:48:05,556 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-12 03:48:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2022-07-12 03:48:05,560 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 39 [2022-07-12 03:48:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:05,560 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2022-07-12 03:48:05,561 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-12 03:48:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2022-07-12 03:48:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 03:48:05,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:05,564 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-12 03:48:05,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:48:05,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -228723188, now seen corresponding path program 1 times [2022-07-12 03:48:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:05,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415501406] [2022-07-12 03:48:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:05,737 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-12 03:48:05,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:05,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415501406] [2022-07-12 03:48:05,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415501406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:05,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:05,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952563957] [2022-07-12 03:48:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:05,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:05,741 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-12 03:48:07,750 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-12 03:48:09,760 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-12 03:48:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:10,031 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2022-07-12 03:48:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:10,032 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-12 03:48:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:10,034 INFO L225 Difference]: With dead ends: 431 [2022-07-12 03:48:10,034 INFO L226 Difference]: Without dead ends: 300 [2022-07-12 03:48:10,034 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-12 03:48:10,035 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-12 03:48:10,036 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-12 03:48:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-12 03:48:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2022-07-12 03:48:10,044 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-12 03:48:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2022-07-12 03:48:10,045 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 40 [2022-07-12 03:48:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:10,045 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2022-07-12 03:48:10,046 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-12 03:48:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2022-07-12 03:48:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 03:48:10,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:10,048 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-12 03:48:10,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:48:10,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1727416149, now seen corresponding path program 1 times [2022-07-12 03:48:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:10,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490098974] [2022-07-12 03:48:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:10,182 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-12 03:48:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:10,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490098974] [2022-07-12 03:48:10,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490098974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:10,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:10,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69949551] [2022-07-12 03:48:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:10,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:10,186 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-12 03:48:12,200 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-12 03:48:14,213 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-12 03:48:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:14,464 INFO L93 Difference]: Finished difference Result 758 states and 1164 transitions. [2022-07-12 03:48:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:14,465 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-12 03:48:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:14,467 INFO L225 Difference]: With dead ends: 758 [2022-07-12 03:48:14,467 INFO L226 Difference]: Without dead ends: 482 [2022-07-12 03:48:14,469 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-12 03:48:14,470 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 113 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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-12 03:48:14,470 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-12 03:48:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-12 03:48:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 308. [2022-07-12 03:48:14,495 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-12 03:48:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 468 transitions. [2022-07-12 03:48:14,495 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 468 transitions. Word has length 55 [2022-07-12 03:48:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:14,496 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 468 transitions. [2022-07-12 03:48:14,496 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-12 03:48:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 468 transitions. [2022-07-12 03:48:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 03:48:14,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:14,497 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-12 03:48:14,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:48:14,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1149096951, now seen corresponding path program 1 times [2022-07-12 03:48:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:14,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452218179] [2022-07-12 03:48:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:14,647 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-12 03:48:14,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:14,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452218179] [2022-07-12 03:48:14,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452218179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:14,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:14,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261097641] [2022-07-12 03:48:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:14,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:14,649 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-12 03:48:16,657 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-12 03:48:18,672 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-12 03:48:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:18,856 INFO L93 Difference]: Finished difference Result 484 states and 735 transitions. [2022-07-12 03:48:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:18,857 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-12 03:48:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:18,858 INFO L225 Difference]: With dead ends: 484 [2022-07-12 03:48:18,858 INFO L226 Difference]: Without dead ends: 324 [2022-07-12 03:48:18,858 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-12 03:48:18,859 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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-12 03:48:18,859 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-12 03:48:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-12 03:48:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2022-07-12 03:48:18,865 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-12 03:48:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2022-07-12 03:48:18,866 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 55 [2022-07-12 03:48:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:18,866 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2022-07-12 03:48:18,866 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-12 03:48:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2022-07-12 03:48:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 03:48:18,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:18,867 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-12 03:48:18,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:48:18,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1382837768, now seen corresponding path program 1 times [2022-07-12 03:48:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:18,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913625050] [2022-07-12 03:48:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:18,980 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-12 03:48:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:18,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913625050] [2022-07-12 03:48:18,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913625050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:18,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:18,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028730371] [2022-07-12 03:48:18,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:18,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:18,983 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-12 03:48:20,995 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-12 03:48:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:21,239 INFO L93 Difference]: Finished difference Result 768 states and 1162 transitions. [2022-07-12 03:48:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:21,240 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-12 03:48:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:21,241 INFO L225 Difference]: With dead ends: 768 [2022-07-12 03:48:21,241 INFO L226 Difference]: Without dead ends: 470 [2022-07-12 03:48:21,242 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-12 03:48:21,243 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:21,243 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.2s Time] [2022-07-12 03:48:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-12 03:48:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 312. [2022-07-12 03:48:21,254 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-12 03:48:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 470 transitions. [2022-07-12 03:48:21,255 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 470 transitions. Word has length 56 [2022-07-12 03:48:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:21,255 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 470 transitions. [2022-07-12 03:48:21,256 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-12 03:48:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 470 transitions. [2022-07-12 03:48:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 03:48:21,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:21,256 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-12 03:48:21,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:48:21,257 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash 270979954, now seen corresponding path program 1 times [2022-07-12 03:48:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:21,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640109046] [2022-07-12 03:48:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:21,344 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-12 03:48:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:21,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640109046] [2022-07-12 03:48:21,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640109046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:21,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:21,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743530952] [2022-07-12 03:48:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:21,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:21,347 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-12 03:48:23,358 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-12 03:48:25,369 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-12 03:48:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:25,523 INFO L93 Difference]: Finished difference Result 490 states and 737 transitions. [2022-07-12 03:48:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:25,523 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-12 03:48:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:25,524 INFO L225 Difference]: With dead ends: 490 [2022-07-12 03:48:25,524 INFO L226 Difference]: Without dead ends: 328 [2022-07-12 03:48:25,525 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-12 03:48:25,525 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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-12 03:48:25,525 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-12 03:48:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-12 03:48:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 312. [2022-07-12 03:48:25,531 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-12 03:48:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 469 transitions. [2022-07-12 03:48:25,532 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 469 transitions. Word has length 57 [2022-07-12 03:48:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:25,533 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 469 transitions. [2022-07-12 03:48:25,533 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-12 03:48:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 469 transitions. [2022-07-12 03:48:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 03:48:25,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:25,535 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-12 03:48:25,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:48:25,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1460862829, now seen corresponding path program 1 times [2022-07-12 03:48:25,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:25,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246659145] [2022-07-12 03:48:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:25,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:25,660 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-12 03:48:25,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:25,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246659145] [2022-07-12 03:48:25,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246659145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:25,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:25,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379492356] [2022-07-12 03:48:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:25,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:25,662 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-12 03:48:27,671 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-12 03:48:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:27,919 INFO L93 Difference]: Finished difference Result 772 states and 1158 transitions. [2022-07-12 03:48:27,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:27,919 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-12 03:48:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:27,921 INFO L225 Difference]: With dead ends: 772 [2022-07-12 03:48:27,921 INFO L226 Difference]: Without dead ends: 470 [2022-07-12 03:48:27,921 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-12 03:48:27,922 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:27,922 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.2s Time] [2022-07-12 03:48:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-12 03:48:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 316. [2022-07-12 03:48:27,929 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-12 03:48:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2022-07-12 03:48:27,930 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 58 [2022-07-12 03:48:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:27,930 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2022-07-12 03:48:27,930 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-12 03:48:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2022-07-12 03:48:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 03:48:27,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:27,931 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-12 03:48:27,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 03:48:27,931 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1518169684, now seen corresponding path program 1 times [2022-07-12 03:48:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:27,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96963151] [2022-07-12 03:48:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:28,015 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-12 03:48:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:28,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96963151] [2022-07-12 03:48:28,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96963151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:28,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:28,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:48:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986361343] [2022-07-12 03:48:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:28,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:48:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:48:28,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:28,018 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-12 03:48:30,024 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-12 03:48:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:30,055 INFO L93 Difference]: Finished difference Result 641 states and 962 transitions. [2022-07-12 03:48:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:48:30,055 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-12 03:48:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:30,057 INFO L225 Difference]: With dead ends: 641 [2022-07-12 03:48:30,057 INFO L226 Difference]: Without dead ends: 477 [2022-07-12 03:48:30,057 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-12 03:48:30,058 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-12 03:48:30,058 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-12 03:48:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-12 03:48:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2022-07-12 03:48:30,065 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-12 03:48:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 710 transitions. [2022-07-12 03:48:30,066 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 710 transitions. Word has length 58 [2022-07-12 03:48:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:30,067 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 710 transitions. [2022-07-12 03:48:30,067 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-12 03:48:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 710 transitions. [2022-07-12 03:48:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 03:48:30,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:30,068 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-12 03:48:30,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 03:48:30,099 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -853569578, now seen corresponding path program 1 times [2022-07-12 03:48:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434231621] [2022-07-12 03:48:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:30,188 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-12 03:48:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:30,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434231621] [2022-07-12 03:48:30,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434231621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:30,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:30,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:48:30,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616293540] [2022-07-12 03:48:30,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:30,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:48:30,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:30,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:48:30,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:30,190 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-12 03:48:32,200 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-12 03:48:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:32,232 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2022-07-12 03:48:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:48:32,233 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-12 03:48:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:32,235 INFO L225 Difference]: With dead ends: 826 [2022-07-12 03:48:32,235 INFO L226 Difference]: Without dead ends: 501 [2022-07-12 03:48:32,236 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-12 03:48:32,236 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:32,236 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.0s Time] [2022-07-12 03:48:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-07-12 03:48:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-07-12 03:48:32,246 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-12 03:48:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 742 transitions. [2022-07-12 03:48:32,247 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 742 transitions. Word has length 58 [2022-07-12 03:48:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:32,247 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 742 transitions. [2022-07-12 03:48:32,248 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-12 03:48:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 742 transitions. [2022-07-12 03:48:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 03:48:32,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:32,249 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-12 03:48:32,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 03:48:32,249 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash -533479020, now seen corresponding path program 1 times [2022-07-12 03:48:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:32,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11082735] [2022-07-12 03:48:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:32,343 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-12 03:48:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:32,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11082735] [2022-07-12 03:48:32,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11082735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:32,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:32,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274382560] [2022-07-12 03:48:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:32,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:32,345 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-12 03:48:34,364 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-12 03:48:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:34,618 INFO L93 Difference]: Finished difference Result 1297 states and 1926 transitions. [2022-07-12 03:48:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:34,618 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-12 03:48:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:34,621 INFO L225 Difference]: With dead ends: 1297 [2022-07-12 03:48:34,621 INFO L226 Difference]: Without dead ends: 806 [2022-07-12 03:48:34,622 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-12 03:48:34,622 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:34,623 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.2s Time] [2022-07-12 03:48:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-07-12 03:48:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 579. [2022-07-12 03:48:34,634 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-12 03:48:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 865 transitions. [2022-07-12 03:48:34,635 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 865 transitions. Word has length 78 [2022-07-12 03:48:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:34,636 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 865 transitions. [2022-07-12 03:48:34,636 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-12 03:48:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 865 transitions. [2022-07-12 03:48:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 03:48:34,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:34,637 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-12 03:48:34,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 03:48:34,637 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash 360007318, now seen corresponding path program 1 times [2022-07-12 03:48:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:34,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531363915] [2022-07-12 03:48:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:34,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:34,757 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-12 03:48:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:34,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531363915] [2022-07-12 03:48:34,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531363915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:34,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:34,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:34,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020331275] [2022-07-12 03:48:34,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:34,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:34,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:34,759 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-12 03:48:36,767 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-12 03:48:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:37,015 INFO L93 Difference]: Finished difference Result 1363 states and 2022 transitions. [2022-07-12 03:48:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:37,020 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-12 03:48:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:37,022 INFO L225 Difference]: With dead ends: 1363 [2022-07-12 03:48:37,022 INFO L226 Difference]: Without dead ends: 794 [2022-07-12 03:48:37,024 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-12 03:48:37,024 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:37,025 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.2s Time] [2022-07-12 03:48:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-12 03:48:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 594. [2022-07-12 03:48:37,036 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-12 03:48:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 892 transitions. [2022-07-12 03:48:37,038 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 892 transitions. Word has length 78 [2022-07-12 03:48:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:37,038 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 892 transitions. [2022-07-12 03:48:37,038 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-12 03:48:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 892 transitions. [2022-07-12 03:48:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-12 03:48:37,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:37,040 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-12 03:48:37,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 03:48:37,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1728932100, now seen corresponding path program 1 times [2022-07-12 03:48:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:37,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644911583] [2022-07-12 03:48:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:37,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:37,152 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-12 03:48:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:37,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644911583] [2022-07-12 03:48:37,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644911583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:37,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:37,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175780693] [2022-07-12 03:48:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:37,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:37,154 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-12 03:48:39,165 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-12 03:48:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:39,392 INFO L93 Difference]: Finished difference Result 1453 states and 2163 transitions. [2022-07-12 03:48:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:39,393 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-12 03:48:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:39,395 INFO L225 Difference]: With dead ends: 1453 [2022-07-12 03:48:39,395 INFO L226 Difference]: Without dead ends: 869 [2022-07-12 03:48:39,396 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-12 03:48:39,397 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:39,398 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.2s Time] [2022-07-12 03:48:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-12 03:48:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 672. [2022-07-12 03:48:39,411 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-12 03:48:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1012 transitions. [2022-07-12 03:48:39,412 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1012 transitions. Word has length 79 [2022-07-12 03:48:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:39,413 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1012 transitions. [2022-07-12 03:48:39,413 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-12 03:48:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1012 transitions. [2022-07-12 03:48:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 03:48:39,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:39,414 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-12 03:48:39,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 03:48:39,414 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:39,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2061764687, now seen corresponding path program 1 times [2022-07-12 03:48:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:39,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442395463] [2022-07-12 03:48:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:39,529 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-12 03:48:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:39,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442395463] [2022-07-12 03:48:39,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442395463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:39,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:39,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79269576] [2022-07-12 03:48:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:39,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:39,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:39,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:39,532 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-12 03:48:41,539 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-12 03:48:43,554 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-12 03:48:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:43,763 INFO L93 Difference]: Finished difference Result 1471 states and 2201 transitions. [2022-07-12 03:48:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:43,772 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-12 03:48:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:43,775 INFO L225 Difference]: With dead ends: 1471 [2022-07-12 03:48:43,775 INFO L226 Difference]: Without dead ends: 809 [2022-07-12 03:48:43,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-12 03:48:43,776 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:43,777 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.2s Time] [2022-07-12 03:48:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-12 03:48:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-12 03:48:43,789 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-12 03:48:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2022-07-12 03:48:43,791 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 80 [2022-07-12 03:48:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:43,791 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2022-07-12 03:48:43,791 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-12 03:48:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2022-07-12 03:48:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 03:48:43,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:43,792 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-12 03:48:43,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 03:48:43,793 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:43,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 793593224, now seen corresponding path program 1 times [2022-07-12 03:48:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:43,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703249718] [2022-07-12 03:48:43,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:43,909 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-12 03:48:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:43,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703249718] [2022-07-12 03:48:43,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703249718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:43,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:43,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949177737] [2022-07-12 03:48:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:43,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:43,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:43,911 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-12 03:48:45,921 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-12 03:48:47,932 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-12 03:48:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:48,127 INFO L93 Difference]: Finished difference Result 1537 states and 2300 transitions. [2022-07-12 03:48:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:48,128 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-12 03:48:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:48,130 INFO L225 Difference]: With dead ends: 1537 [2022-07-12 03:48:48,130 INFO L226 Difference]: Without dead ends: 809 [2022-07-12 03:48:48,132 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-12 03:48:48,133 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 48 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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-12 03:48:48,134 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-12 03:48:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-12 03:48:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-12 03:48:48,146 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-12 03:48:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1111 transitions. [2022-07-12 03:48:48,147 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1111 transitions. Word has length 95 [2022-07-12 03:48:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:48,147 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1111 transitions. [2022-07-12 03:48:48,147 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-12 03:48:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1111 transitions. [2022-07-12 03:48:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 03:48:48,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:48,149 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-12 03:48:48,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 03:48:48,149 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1231158467, now seen corresponding path program 1 times [2022-07-12 03:48:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:48,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730811907] [2022-07-12 03:48:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:48,270 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-12 03:48:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:48,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730811907] [2022-07-12 03:48:48,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730811907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:48,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:48,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030905577] [2022-07-12 03:48:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:48,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:48,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:48,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:48,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:48,273 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-12 03:48:50,293 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-12 03:48:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:50,558 INFO L93 Difference]: Finished difference Result 1666 states and 2484 transitions. [2022-07-12 03:48:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:50,559 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-12 03:48:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:50,561 INFO L225 Difference]: With dead ends: 1666 [2022-07-12 03:48:50,561 INFO L226 Difference]: Without dead ends: 938 [2022-07-12 03:48:50,562 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-12 03:48:50,563 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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-12 03:48:50,563 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-12 03:48:50,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-12 03:48:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 738. [2022-07-12 03:48:50,577 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-12 03:48:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1096 transitions. [2022-07-12 03:48:50,578 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1096 transitions. Word has length 97 [2022-07-12 03:48:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:50,579 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1096 transitions. [2022-07-12 03:48:50,579 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-12 03:48:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1096 transitions. [2022-07-12 03:48:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 03:48:50,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:50,580 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-12 03:48:50,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 03:48:50,581 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1142724731, now seen corresponding path program 1 times [2022-07-12 03:48:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:50,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573971756] [2022-07-12 03:48:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:50,691 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-12 03:48:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573971756] [2022-07-12 03:48:50,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573971756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:50,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:50,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:50,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208862982] [2022-07-12 03:48:50,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:50,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:50,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:50,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:50,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:50,694 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-12 03:48:52,702 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-12 03:48:54,715 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-12 03:48:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:54,918 INFO L93 Difference]: Finished difference Result 1510 states and 2231 transitions. [2022-07-12 03:48:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:54,928 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-12 03:48:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:54,931 INFO L225 Difference]: With dead ends: 1510 [2022-07-12 03:48:54,931 INFO L226 Difference]: Without dead ends: 782 [2022-07-12 03:48:54,933 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-12 03:48:54,934 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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-12 03:48:54,934 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-12 03:48:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-07-12 03:48:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 738. [2022-07-12 03:48:54,949 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-12 03:48:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1093 transitions. [2022-07-12 03:48:54,951 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1093 transitions. Word has length 98 [2022-07-12 03:48:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:54,951 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1093 transitions. [2022-07-12 03:48:54,951 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-12 03:48:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1093 transitions. [2022-07-12 03:48:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 03:48:54,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:54,953 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-12 03:48:54,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 03:48:54,954 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:54,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2022-07-12 03:48:54,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:54,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275453683] [2022-07-12 03:48:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:55,075 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-12 03:48:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:55,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275453683] [2022-07-12 03:48:55,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275453683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:55,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:55,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:48:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991468702] [2022-07-12 03:48:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:55,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:48:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:48:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:55,077 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-12 03:48:57,090 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-12 03:48:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:57,132 INFO L93 Difference]: Finished difference Result 1485 states and 2202 transitions. [2022-07-12 03:48:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:48:57,133 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-12 03:48:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:57,135 INFO L225 Difference]: With dead ends: 1485 [2022-07-12 03:48:57,135 INFO L226 Difference]: Without dead ends: 978 [2022-07-12 03:48:57,136 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-12 03:48:57,136 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-12 03:48:57,137 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-12 03:48:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-07-12 03:48:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2022-07-12 03:48:57,152 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-12 03:48:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1445 transitions. [2022-07-12 03:48:57,154 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1445 transitions. Word has length 98 [2022-07-12 03:48:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:57,154 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1445 transitions. [2022-07-12 03:48:57,155 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-12 03:48:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1445 transitions. [2022-07-12 03:48:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 03:48:57,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:57,156 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-12 03:48:57,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 03:48:57,156 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2022-07-12 03:48:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:57,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414358142] [2022-07-12 03:48:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:57,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:57,261 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-12 03:48:57,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:57,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414358142] [2022-07-12 03:48:57,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414358142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:57,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:57,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:48:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119204057] [2022-07-12 03:48:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:57,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:48:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:48:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:57,264 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-12 03:48:59,271 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-12 03:48:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:59,325 INFO L93 Difference]: Finished difference Result 1695 states and 2507 transitions. [2022-07-12 03:48:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:48:59,325 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-12 03:48:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:59,328 INFO L225 Difference]: With dead ends: 1695 [2022-07-12 03:48:59,328 INFO L226 Difference]: Without dead ends: 950 [2022-07-12 03:48:59,329 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-12 03:48:59,329 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:59,329 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.1s Time] [2022-07-12 03:48:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-12 03:48:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2022-07-12 03:48:59,343 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-12 03:48:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1399 transitions. [2022-07-12 03:48:59,344 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1399 transitions. Word has length 98 [2022-07-12 03:48:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:59,345 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1399 transitions. [2022-07-12 03:48:59,345 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-12 03:48:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1399 transitions. [2022-07-12 03:48:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 03:48:59,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:59,346 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-12 03:48:59,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 03:48:59,346 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash -741144714, now seen corresponding path program 1 times [2022-07-12 03:48:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:59,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882483582] [2022-07-12 03:48:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:59,453 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-12 03:48:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:59,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882483582] [2022-07-12 03:48:59,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882483582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:59,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:59,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123947224] [2022-07-12 03:48:59,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:59,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:59,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:59,456 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-12 03:49:01,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:49:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:01,712 INFO L93 Difference]: Finished difference Result 2150 states and 3137 transitions. [2022-07-12 03:49:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:49:01,713 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-12 03:49:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:01,716 INFO L225 Difference]: With dead ends: 2150 [2022-07-12 03:49:01,716 INFO L226 Difference]: Without dead ends: 1210 [2022-07-12 03:49:01,717 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-12 03:49:01,717 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:49:01,718 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.2s Time] [2022-07-12 03:49:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-07-12 03:49:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 958. [2022-07-12 03:49:01,732 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-12 03:49:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1411 transitions. [2022-07-12 03:49:01,733 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1411 transitions. Word has length 101 [2022-07-12 03:49:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:01,734 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1411 transitions. [2022-07-12 03:49:01,734 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-12 03:49:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1411 transitions. [2022-07-12 03:49:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 03:49:01,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:01,735 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-12 03:49:01,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 03:49:01,736 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-12 03:49:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:49:01,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769896478] [2022-07-12 03:49:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:49:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:01,922 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-12 03:49:01,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:49:01,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769896478] [2022-07-12 03:49:01,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769896478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:01,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:01,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:49:01,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071864599] [2022-07-12 03:49:01,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:01,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:49:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:49:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:49:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:49:01,924 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-12 03:49:03,931 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-12 03:49:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:04,066 INFO L93 Difference]: Finished difference Result 1907 states and 2808 transitions. [2022-07-12 03:49:04,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:49:04,067 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-12 03:49:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:04,069 INFO L225 Difference]: With dead ends: 1907 [2022-07-12 03:49:04,069 INFO L226 Difference]: Without dead ends: 959 [2022-07-12 03:49:04,073 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-12 03:49:04,074 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:49:04,075 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.1s Time] [2022-07-12 03:49:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-12 03:49:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2022-07-12 03:49:04,090 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-12 03:49:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1410 transitions. [2022-07-12 03:49:04,091 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1410 transitions. Word has length 122 [2022-07-12 03:49:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:04,092 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1410 transitions. [2022-07-12 03:49:04,092 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-12 03:49:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1410 transitions. [2022-07-12 03:49:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 03:49:04,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:04,094 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-12 03:49:04,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 03:49:04,094 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:04,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-12 03:49:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:49:04,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607406716] [2022-07-12 03:49:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:49:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:49:04,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:49:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:49:04,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:49:04,786 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:49:04,787 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:49:04,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 03:49:04,795 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-12 03:49:04,798 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:49:04,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:49:04 BoogieIcfgContainer [2022-07-12 03:49:04,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:49:04,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:49:04,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:49:04,934 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:49:04,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:02" (3/4) ... [2022-07-12 03:49:04,936 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:49:04,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:49:04,937 INFO L158 Benchmark]: Toolchain (without parser) took 66425.17ms. Allocated memory was 90.2MB in the beginning and 146.8MB in the end (delta: 56.6MB). Free memory was 56.5MB in the beginning and 85.8MB in the end (delta: -29.4MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2022-07-12 03:49:04,937 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 45.2MB in the beginning and 45.2MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:49:04,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.24ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 56.3MB in the beginning and 78.4MB in the end (delta: -22.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:49:04,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.43ms. Allocated memory is still 121.6MB. Free memory was 78.4MB in the beginning and 73.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:49:04,938 INFO L158 Benchmark]: Boogie Preprocessor took 58.67ms. Allocated memory is still 121.6MB. Free memory was 73.5MB in the beginning and 67.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:49:04,938 INFO L158 Benchmark]: RCFGBuilder took 2926.05ms. Allocated memory is still 121.6MB. Free memory was 67.2MB in the beginning and 46.0MB in the end (delta: 21.2MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2022-07-12 03:49:04,938 INFO L158 Benchmark]: TraceAbstraction took 62867.26ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 92.4MB in the beginning and 85.8MB in the end (delta: 6.5MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2022-07-12 03:49:04,938 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 146.8MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:49:04,939 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 90.2MB. Free memory was 45.2MB in the beginning and 45.2MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.24ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 56.3MB in the beginning and 78.4MB in the end (delta: -22.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.43ms. Allocated memory is still 121.6MB. Free memory was 78.4MB in the beginning and 73.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.67ms. Allocated memory is still 121.6MB. Free memory was 73.5MB in the beginning and 67.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2926.05ms. Allocated memory is still 121.6MB. Free memory was 67.2MB in the beginning and 46.0MB in the end (delta: 21.2MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * TraceAbstraction took 62867.26ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 92.4MB in the beginning and 85.8MB in the end (delta: 6.5MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 146.8MB. Free memory is still 85.8MB. 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: 62.7s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 57.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1796 mSDsluCounter, 8169 SdHoareTripleChecker+Invalid, 56.9s 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.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1937 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 1.2s 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-12 03:49:04,974 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-?-6c24879 [2022-07-12 03:49:06,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:49:06,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:49:06,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:49:06,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:49:06,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:49:06,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:49:06,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:49:06,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:49:06,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:49:06,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:49:06,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:49:06,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:49:06,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:49:06,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:49:06,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:49:06,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:49:06,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:49:06,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:49:06,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:49:06,623 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:49:06,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:49:06,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:49:06,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:49:06,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:49:06,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:49:06,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:49:06,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:49:06,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:49:06,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:49:06,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:49:06,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:49:06,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:49:06,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:49:06,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:49:06,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:49:06,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:49:06,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:49:06,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:49:06,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:49:06,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:49:06,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:49:06,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:49:06,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:49:06,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:49:06,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:49:06,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:49:06,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:49:06,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:49:06,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:49:06,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:49:06,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:49:06,689 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:49:06,690 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:49:06,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:49:06,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:49:06,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:49:06,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:49:06,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:49:06,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:49:06,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:49:06,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:49:06,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:49:06,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:49:06,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:49:06,691 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:49:06,691 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:49:06,691 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:49:06,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:49:06,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:49:06,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:49:06,692 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-12 03:49:06,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:49:06,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:49:06,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:49:06,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:49:06,999 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:49:07,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-12 03:49:07,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c97c6dd3/6d0b18a2713e49d2bee62f5f2974b6d1/FLAGe6eb57e17 [2022-07-12 03:49:07,511 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:49:07,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-12 03:49:07,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c97c6dd3/6d0b18a2713e49d2bee62f5f2974b6d1/FLAGe6eb57e17 [2022-07-12 03:49:07,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c97c6dd3/6d0b18a2713e49d2bee62f5f2974b6d1 [2022-07-12 03:49:07,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:49:07,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:49:07,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:49:07,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:49:07,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:49:07,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:49:07" (1/1) ... [2022-07-12 03:49:07,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ac680b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:07, skipping insertion in model container [2022-07-12 03:49:07,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:49:07" (1/1) ... [2022-07-12 03:49:07,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:49:07,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:49:07,928 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-12 03:49:07,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:49:07,954 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 03:49:07,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:49:08,044 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-12 03:49:08,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:49:08,055 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:49:08,105 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-12 03:49:08,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:49:08,127 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:49:08,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08 WrapperNode [2022-07-12 03:49:08,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:49:08,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:49:08,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:49:08,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:49:08,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,207 INFO L137 Inliner]: procedures = 34, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 702 [2022-07-12 03:49:08,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:49:08,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:49:08,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:49:08,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:49:08,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:49:08,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:49:08,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:49:08,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:49:08,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (1/1) ... [2022-07-12 03:49:08,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:49:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:49:08,322 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-12 03:49:08,341 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-12 03:49:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:49:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:49:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:49:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:49:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:49:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:49:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:49:08,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:49:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:49:08,541 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:49:08,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:49:08,562 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 03:49:15,191 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-12 03:49:15,192 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-12 03:49:15,192 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:49:15,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:49:15,197 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 03:49:15,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:49:15 BoogieIcfgContainer [2022-07-12 03:49:15,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:49:15,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:49:15,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:49:15,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:49:15,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:49:07" (1/3) ... [2022-07-12 03:49:15,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539d4032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:49:15, skipping insertion in model container [2022-07-12 03:49:15,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:49:08" (2/3) ... [2022-07-12 03:49:15,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539d4032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:49:15, skipping insertion in model container [2022-07-12 03:49:15,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:49:15" (3/3) ... [2022-07-12 03:49:15,204 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-12 03:49:15,213 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:49:15,213 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:49:15,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:49:15,252 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@3aeda88c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9353854 [2022-07-12 03:49:15,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:49:15,258 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-12 03:49:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:49:15,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:15,265 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-12 03:49:15,266 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-12 03:49:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:15,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989026618] [2022-07-12 03:49:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:15,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:15,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:15,289 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-12 03:49:15,290 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-12 03:49:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:15,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:49:15,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:15,942 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-12 03:49:15,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:49:15,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:49:15,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989026618] [2022-07-12 03:49:15,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989026618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:15,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:49:15,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430936483] [2022-07-12 03:49:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:15,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:49:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:49:15,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:49:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:49:15,967 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-12 03:49:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:16,113 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-12 03:49:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:49:16,115 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-12 03:49:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:16,127 INFO L225 Difference]: With dead ends: 375 [2022-07-12 03:49:16,127 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 03:49:16,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:49:16,135 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-12 03:49:16,139 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-12 03:49:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 03:49:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-12 03:49:16,177 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-12 03:49:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-12 03:49:16,180 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-12 03:49:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:16,181 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-12 03:49:16,181 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-12 03:49:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-12 03:49:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 03:49:16,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:16,183 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-12 03:49:16,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:49:16,383 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-12 03:49:16,384 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-12 03:49:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:16,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433546329] [2022-07-12 03:49:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:16,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:16,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:16,387 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-12 03:49:16,389 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-12 03:49:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:16,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:49:16,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:17,031 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-12 03:49:17,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:49:17,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:49:17,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433546329] [2022-07-12 03:49:17,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433546329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:17,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:17,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:49:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651257875] [2022-07-12 03:49:17,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:17,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:49:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:49:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:49:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:49:17,034 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-12 03:49:19,054 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-12 03:49:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:19,155 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-07-12 03:49:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:49:19,156 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-12 03:49:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:19,158 INFO L225 Difference]: With dead ends: 426 [2022-07-12 03:49:19,158 INFO L226 Difference]: Without dead ends: 319 [2022-07-12 03:49:19,158 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-12 03:49:19,159 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-12 03:49:19,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 03:49:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-12 03:49:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-07-12 03:49:19,171 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-12 03:49:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-07-12 03:49:19,172 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-07-12 03:49:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:19,172 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-07-12 03:49:19,173 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-12 03:49:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-07-12 03:49:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 03:49:19,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:19,192 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-12 03:49:19,210 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-12 03:49:19,400 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-12 03:49:19,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-07-12 03:49:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:19,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309485863] [2022-07-12 03:49:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:19,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:19,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:19,408 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-12 03:49:19,409 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-12 03:49:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:19,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:49:19,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:20,087 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-12 03:49:20,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:49:20,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:49:20,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309485863] [2022-07-12 03:49:20,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309485863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:20,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:20,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:49:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135105464] [2022-07-12 03:49:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:20,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:49:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:49:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:49:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:49:20,089 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-12 03:49:22,109 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-12 03:49:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:22,199 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-07-12 03:49:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:49:22,200 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-12 03:49:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:22,202 INFO L225 Difference]: With dead ends: 632 [2022-07-12 03:49:22,202 INFO L226 Difference]: Without dead ends: 423 [2022-07-12 03:49:22,203 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-12 03:49:22,203 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-12 03:49:22,204 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-12 03:49:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-12 03:49:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-07-12 03:49:22,226 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-12 03:49:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-07-12 03:49:22,228 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-07-12 03:49:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:22,228 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-07-12 03:49:22,229 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-12 03:49:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-07-12 03:49:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 03:49:22,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:22,232 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-12 03:49:22,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 03:49:22,447 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-12 03:49:22,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-07-12 03:49:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:22,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197139307] [2022-07-12 03:49:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:22,452 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-12 03:49:22,453 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-12 03:49:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:23,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:49:23,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:23,192 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-12 03:49:23,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:49:23,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:49:23,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197139307] [2022-07-12 03:49:23,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197139307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:23,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:23,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:49:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957372948] [2022-07-12 03:49:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:23,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:49:23,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:49:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:49:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:49:23,194 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-12 03:49:25,211 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-12 03:49:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:25,342 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-07-12 03:49:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:49:25,342 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-12 03:49:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:25,344 INFO L225 Difference]: With dead ends: 839 [2022-07-12 03:49:25,344 INFO L226 Difference]: Without dead ends: 526 [2022-07-12 03:49:25,345 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-12 03:49:25,345 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-12 03:49:25,346 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-12 03:49:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-12 03:49:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-07-12 03:49:25,354 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-12 03:49:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-07-12 03:49:25,356 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-07-12 03:49:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:25,356 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-07-12 03:49:25,356 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-12 03:49:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-07-12 03:49:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 03:49:25,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:25,360 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-12 03:49:25,383 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-12 03:49:25,575 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-12 03:49:25,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-07-12 03:49:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:25,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764539323] [2022-07-12 03:49:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:25,578 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-12 03:49:25,580 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-12 03:49:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:26,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:49:26,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:26,365 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-12 03:49:26,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:49:26,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:49:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764539323] [2022-07-12 03:49:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764539323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:26,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:26,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:49:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575505138] [2022-07-12 03:49:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:26,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:49:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:49:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:49:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:49:26,367 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-12 03:49:28,384 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-12 03:49:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:28,465 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-07-12 03:49:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:49:28,465 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-12 03:49:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:28,468 INFO L225 Difference]: With dead ends: 939 [2022-07-12 03:49:28,468 INFO L226 Difference]: Without dead ends: 523 [2022-07-12 03:49:28,468 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-12 03:49:28,469 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-12 03:49:28,469 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-12 03:49:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-12 03:49:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-12 03:49:28,477 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-12 03:49:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-07-12 03:49:28,478 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-07-12 03:49:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:28,479 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-07-12 03:49:28,479 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-12 03:49:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-07-12 03:49:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 03:49:28,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:28,482 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-12 03:49:28,506 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-12 03:49:28,689 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-12 03:49:28,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-07-12 03:49:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:28,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182574120] [2022-07-12 03:49:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:28,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:28,691 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-12 03:49:28,693 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-12 03:49:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:29,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:49:29,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:29,953 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-12 03:49:29,953 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-12 03:49:30,214 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-12 03:49:30,215 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-12 03:49:30,345 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:49:30,345 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-12 03:49:30,397 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-12 03:49:30,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:49:30,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:49:30,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182574120] [2022-07-12 03:49:30,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182574120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:30,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:30,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:49:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820202659] [2022-07-12 03:49:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:30,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:49:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:49:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:49:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:49:30,399 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-12 03:49:32,426 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-12 03:49:34,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:49:39,987 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-12 03:49:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:40,087 INFO L93 Difference]: Finished difference Result 1191 states and 1739 transitions. [2022-07-12 03:49:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:49:40,089 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-12 03:49:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:40,091 INFO L225 Difference]: With dead ends: 1191 [2022-07-12 03:49:40,091 INFO L226 Difference]: Without dead ends: 675 [2022-07-12 03:49:40,092 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-12 03:49:40,092 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:49:40,092 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.6s Time] [2022-07-12 03:49:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-07-12 03:49:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 607. [2022-07-12 03:49:40,105 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-12 03:49:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 903 transitions. [2022-07-12 03:49:40,107 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 903 transitions. Word has length 100 [2022-07-12 03:49:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:40,108 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 903 transitions. [2022-07-12 03:49:40,108 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-12 03:49:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 903 transitions. [2022-07-12 03:49:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 03:49:40,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:40,110 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-12 03:49:40,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:49:40,329 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-12 03:49:40,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2022-07-12 03:49:40,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:40,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653521083] [2022-07-12 03:49:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:40,332 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-12 03:49:40,333 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-12 03:49:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:41,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:49:41,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:41,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:49:41,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:49:41,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:49:41,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:49:41,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:49:41,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:49:42,283 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-12 03:49:42,283 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-12 03:49:43,128 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:49:43,129 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-12 03:49:43,162 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-12 03:49:43,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:49:43,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:49:43,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653521083] [2022-07-12 03:49:43,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653521083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:49:43,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:49:43,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:49:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962142] [2022-07-12 03:49:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:49:43,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:49:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:49:43,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:49:43,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:49:43,164 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-12 03:49:45,187 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-12 03:49:47,196 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-12 03:49:54,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:49:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:49:56,916 INFO L93 Difference]: Finished difference Result 1413 states and 2092 transitions. [2022-07-12 03:49:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:49:56,937 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-12 03:49:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:49:56,941 INFO L225 Difference]: With dead ends: 1413 [2022-07-12 03:49:56,942 INFO L226 Difference]: Without dead ends: 813 [2022-07-12 03:49:56,942 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-12 03:49:56,943 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 46 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:49:56,943 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.6s Time] [2022-07-12 03:49:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-12 03:49:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 703. [2022-07-12 03:49:56,958 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-12 03:49:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1071 transitions. [2022-07-12 03:49:56,959 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1071 transitions. Word has length 100 [2022-07-12 03:49:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:49:56,960 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1071 transitions. [2022-07-12 03:49:56,960 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-12 03:49:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1071 transitions. [2022-07-12 03:49:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 03:49:56,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:49:56,961 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-12 03:49:56,999 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-12 03:49:57,179 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-12 03:49:57,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:49:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:49:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2022-07-12 03:49:57,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:49:57,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351811132] [2022-07-12 03:49:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:49:57,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:49:57,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:49:57,183 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-12 03:49:57,184 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-12 03:49:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:49:59,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:49:59,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:49:59,992 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-12 03:49:59,993 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-12 03:50:00,072 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:50:00,073 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-12 03:50:00,114 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-12 03:50:00,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:50:00,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:50:00,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351811132] [2022-07-12 03:50:00,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351811132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:50:00,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:50:00,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:50:00,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554557813] [2022-07-12 03:50:00,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:50:00,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:50:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:50:00,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:50:00,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:50:00,116 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-12 03:50:02,141 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-12 03:50:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:50:05,123 INFO L93 Difference]: Finished difference Result 1464 states and 2226 transitions. [2022-07-12 03:50:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:50:05,126 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-12 03:50:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:50:05,128 INFO L225 Difference]: With dead ends: 1464 [2022-07-12 03:50:05,128 INFO L226 Difference]: Without dead ends: 768 [2022-07-12 03:50:05,129 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-12 03:50:05,130 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 5.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:50:05,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 1 Unknown, 15 Unchecked, 5.0s Time] [2022-07-12 03:50:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-07-12 03:50:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2022-07-12 03:50:05,155 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-12 03:50:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1153 transitions. [2022-07-12 03:50:05,157 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1153 transitions. Word has length 115 [2022-07-12 03:50:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:50:05,157 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1153 transitions. [2022-07-12 03:50:05,157 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-12 03:50:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1153 transitions. [2022-07-12 03:50:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 03:50:05,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:50:05,159 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-12 03:50:05,192 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-12 03:50:05,379 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-12 03:50:05,380 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:50:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:50:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2022-07-12 03:50:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:50:05,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997324948] [2022-07-12 03:50:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:50:05,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:50:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:50:05,382 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-12 03:50:05,384 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-12 03:50:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:50:06,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:50:06,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:50:07,448 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-12 03:50:07,448 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-12 03:50:07,567 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:50:07,568 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-12 03:50:07,615 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-12 03:50:07,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:50:07,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:50:07,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997324948] [2022-07-12 03:50:07,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997324948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:50:07,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:50:07,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:50:07,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51466674] [2022-07-12 03:50:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:50:07,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:50:07,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:50:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:50:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:50:07,616 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-12 03:50:09,649 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-12 03:50:11,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:50:12,791 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-12 03:50:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:50:15,439 INFO L93 Difference]: Finished difference Result 1534 states and 2305 transitions. [2022-07-12 03:50:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:50:15,443 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-12 03:50:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:50:15,446 INFO L225 Difference]: With dead ends: 1534 [2022-07-12 03:50:15,446 INFO L226 Difference]: Without dead ends: 773 [2022-07-12 03:50:15,447 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-12 03:50:15,449 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:50:15,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 1 Unknown, 18 Unchecked, 7.7s Time] [2022-07-12 03:50:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-12 03:50:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2022-07-12 03:50:15,468 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-12 03:50:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1150 transitions. [2022-07-12 03:50:15,470 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1150 transitions. Word has length 115 [2022-07-12 03:50:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:50:15,470 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1150 transitions. [2022-07-12 03:50:15,470 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-12 03:50:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1150 transitions. [2022-07-12 03:50:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 03:50:15,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:50:15,472 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-12 03:50:15,508 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-12 03:50:15,695 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-12 03:50:15,696 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:50:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:50:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash -647023955, now seen corresponding path program 1 times [2022-07-12 03:50:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:50:15,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860987980] [2022-07-12 03:50:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:50:15,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:50:15,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:50:15,699 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-12 03:50:15,701 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-12 03:50:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:50:17,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:50:17,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:50:17,603 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 03:50:17,603 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-12 03:50:17,724 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:50:17,725 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-12 03:50:17,757 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-12 03:50:17,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:50:17,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:50:17,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860987980] [2022-07-12 03:50:17,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860987980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:50:17,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:50:17,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:50:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632771815] [2022-07-12 03:50:17,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:50:17,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:50:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:50:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:50:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:50:17,759 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-12 03:50:19,782 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-12 03:50:25,231 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-12 03:50:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:50:25,640 INFO L93 Difference]: Finished difference Result 1415 states and 2093 transitions. [2022-07-12 03:50:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:50:25,643 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-12 03:50:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:50:25,645 INFO L225 Difference]: With dead ends: 1415 [2022-07-12 03:50:25,645 INFO L226 Difference]: Without dead ends: 809 [2022-07-12 03:50:25,646 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-12 03:50:25,646 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s 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, 7.8s IncrementalHoareTripleChecker+Time [2022-07-12 03:50:25,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 460 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 1 Unknown, 19 Unchecked, 7.8s Time] [2022-07-12 03:50:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-12 03:50:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 773. [2022-07-12 03:50:25,668 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-12 03:50:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1146 transitions. [2022-07-12 03:50:25,669 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1146 transitions. Word has length 115 [2022-07-12 03:50:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:50:25,670 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1146 transitions. [2022-07-12 03:50:25,670 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-12 03:50:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1146 transitions. [2022-07-12 03:50:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 03:50:25,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:50:25,672 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-12 03:50:25,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 03:50:25,891 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-12 03:50:25,892 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:50:25,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:50:25,894 INFO L85 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2022-07-12 03:50:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:50:25,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265448122] [2022-07-12 03:50:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:50:25,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:50:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:50:25,896 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-12 03:50:25,897 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-12 03:50:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:50:28,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:50:28,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:50:28,898 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-12 03:50:28,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, 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-12 03:50:28,982 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:50:28,982 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-12 03:50:29,016 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-12 03:50:29,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:50:29,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:50:29,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265448122] [2022-07-12 03:50:29,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265448122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:50:29,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:50:29,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:50:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630439289] [2022-07-12 03:50:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:50:29,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:50:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:50:29,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:50:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:50:29,017 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-12 03:50:31,041 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-12 03:50:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:50:34,923 INFO L93 Difference]: Finished difference Result 1544 states and 2291 transitions. [2022-07-12 03:50:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:50:34,926 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-12 03:50:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:50:34,929 INFO L225 Difference]: With dead ends: 1544 [2022-07-12 03:50:34,929 INFO L226 Difference]: Without dead ends: 778 [2022-07-12 03:50:34,930 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-12 03:50:34,930 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 03:50:34,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 81 Invalid, 1 Unknown, 17 Unchecked, 5.9s Time] [2022-07-12 03:50:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-12 03:50:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-07-12 03:50:34,943 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-12 03:50:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1143 transitions. [2022-07-12 03:50:34,945 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1143 transitions. Word has length 116 [2022-07-12 03:50:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:50:34,945 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1143 transitions. [2022-07-12 03:50:34,945 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-12 03:50:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1143 transitions. [2022-07-12 03:50:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 03:50:34,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:50:34,946 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-12 03:50:34,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:50:35,167 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-12 03:50:35,167 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:50:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:50:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash -710278962, now seen corresponding path program 1 times [2022-07-12 03:50:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:50:35,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86239234] [2022-07-12 03:50:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:50:35,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:50:35,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:50:35,171 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-12 03:50:35,173 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-12 03:50:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:50:36,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:50:36,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:50:37,135 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 03:50:37,135 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-12 03:50:37,244 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:50:37,244 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-12 03:50:37,274 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-12 03:50:37,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:50:37,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:50:37,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86239234] [2022-07-12 03:50:37,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86239234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:50:37,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:50:37,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:50:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10976251] [2022-07-12 03:50:37,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:50:37,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:50:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:50:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:50:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:50:37,276 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-12 03:50:39,302 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-12 03:50:43,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:50:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:50:44,477 INFO L93 Difference]: Finished difference Result 1424 states and 2081 transitions. [2022-07-12 03:50:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:50:44,479 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-12 03:50:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:50:44,481 INFO L225 Difference]: With dead ends: 1424 [2022-07-12 03:50:44,481 INFO L226 Difference]: Without dead ends: 814 [2022-07-12 03:50:44,494 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-12 03:50:44,495 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s 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, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:50:44,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 458 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 1 Unknown, 20 Unchecked, 7.1s Time] [2022-07-12 03:50:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-07-12 03:50:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 778. [2022-07-12 03:50:44,508 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-12 03:50:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1139 transitions. [2022-07-12 03:50:44,509 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1139 transitions. Word has length 116 [2022-07-12 03:50:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:50:44,510 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1139 transitions. [2022-07-12 03:50:44,510 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-12 03:50:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1139 transitions. [2022-07-12 03:50:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 03:50:44,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:50:44,511 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-12 03:50:44,537 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-12 03:50:44,737 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-12 03:50:44,737 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:50:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:50:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2022-07-12 03:50:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:50:44,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109932130] [2022-07-12 03:50:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:50:44,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:50:44,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:50:44,740 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-12 03:50:44,741 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-12 03:50:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:50:46,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:50:46,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:50:46,978 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-12 03:50:46,979 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-12 03:50:47,076 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:50:47,077 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-12 03:50:47,114 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-12 03:50:47,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:50:47,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:50:47,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109932130] [2022-07-12 03:50:47,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109932130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:50:47,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:50:47,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:50:47,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997521287] [2022-07-12 03:50:47,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:50:47,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:50:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:50:47,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:50:47,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:50:47,116 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-12 03:50:49,140 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-12 03:50:51,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:50:54,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:50:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:50:54,335 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-12 03:50:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:50:54,338 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-12 03:50:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:50:54,341 INFO L225 Difference]: With dead ends: 1554 [2022-07-12 03:50:54,341 INFO L226 Difference]: Without dead ends: 783 [2022-07-12 03:50:54,342 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-12 03:50:54,343 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:50:54,343 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.2s Time] [2022-07-12 03:50:54,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-07-12 03:50:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2022-07-12 03:50:54,357 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-12 03:50:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1136 transitions. [2022-07-12 03:50:54,358 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1136 transitions. Word has length 117 [2022-07-12 03:50:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:50:54,359 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1136 transitions. [2022-07-12 03:50:54,359 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-12 03:50:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1136 transitions. [2022-07-12 03:50:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 03:50:54,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:50:54,361 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-12 03:50:54,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-12 03:50:54,567 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-12 03:50:54,568 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:50:54,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:50:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2022-07-12 03:50:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:50:54,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191469790] [2022-07-12 03:50:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:50:54,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:50:54,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:50:54,570 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-12 03:50:54,570 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-12 03:50:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:50:56,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:50:56,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:50:56,841 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-12 03:50:56,841 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-12 03:50:56,937 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:50:56,938 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-12 03:50:56,969 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-12 03:50:56,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:50:56,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:50:56,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191469790] [2022-07-12 03:50:56,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191469790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:50:56,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:50:56,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:50:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321040155] [2022-07-12 03:50:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:50:56,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:50:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:50:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:50:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:50:56,971 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-12 03:50:58,993 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-12 03:51:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:51:02,785 INFO L93 Difference]: Finished difference Result 1564 states and 2271 transitions. [2022-07-12 03:51:02,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:51:02,788 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-12 03:51:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:51:02,790 INFO L225 Difference]: With dead ends: 1564 [2022-07-12 03:51:02,790 INFO L226 Difference]: Without dead ends: 788 [2022-07-12 03:51:02,791 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-12 03:51:02,791 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s 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, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:51:02,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 1 Unknown, 21 Unchecked, 5.7s Time] [2022-07-12 03:51:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-12 03:51:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-12 03:51:02,867 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-12 03:51:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1133 transitions. [2022-07-12 03:51:02,869 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1133 transitions. Word has length 118 [2022-07-12 03:51:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:51:02,869 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1133 transitions. [2022-07-12 03:51:02,869 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-12 03:51:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1133 transitions. [2022-07-12 03:51:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 03:51:02,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:51:02,871 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-12 03:51:02,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-12 03:51:03,099 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-12 03:51:03,100 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:51:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:51:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2022-07-12 03:51:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:51:03,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950070305] [2022-07-12 03:51:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:51:03,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:51:03,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:51:03,102 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-12 03:51:03,104 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-12 03:51:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:51:04,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:51:04,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:51:05,467 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 03:51:05,468 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-12 03:51:05,593 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:51:05,594 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-12 03:51:05,627 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-12 03:51:05,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:51:05,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:51:05,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950070305] [2022-07-12 03:51:05,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950070305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:51:05,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:51:05,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:51:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538256617] [2022-07-12 03:51:05,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:51:05,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:51:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:51:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:51:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:51:05,629 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-12 03:51:07,665 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-12 03:51:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:51:11,468 INFO L93 Difference]: Finished difference Result 1569 states and 2255 transitions. [2022-07-12 03:51:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:51:11,471 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-12 03:51:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:51:11,473 INFO L225 Difference]: With dead ends: 1569 [2022-07-12 03:51:11,473 INFO L226 Difference]: Without dead ends: 788 [2022-07-12 03:51:11,474 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-12 03:51:11,474 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 03:51:11,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 18 Unchecked, 5.8s Time] [2022-07-12 03:51:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-12 03:51:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-12 03:51:11,488 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-12 03:51:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1129 transitions. [2022-07-12 03:51:11,489 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1129 transitions. Word has length 118 [2022-07-12 03:51:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:51:11,490 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1129 transitions. [2022-07-12 03:51:11,490 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-12 03:51:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1129 transitions. [2022-07-12 03:51:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 03:51:11,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:51:11,496 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-12 03:51:11,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-12 03:51:11,711 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-12 03:51:11,711 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:51:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:51:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1781105215, now seen corresponding path program 1 times [2022-07-12 03:51:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:51:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535934064] [2022-07-12 03:51:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:51:11,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:51:11,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:51:11,714 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-12 03:51:11,716 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-12 03:51:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:51:13,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:51:13,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:51:14,184 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 03:51:14,184 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-12 03:51:14,318 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:51:14,318 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-12 03:51:14,349 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-12 03:51:14,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:51:14,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:51:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535934064] [2022-07-12 03:51:14,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535934064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:51:14,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:51:14,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:51:14,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438031441] [2022-07-12 03:51:14,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:51:14,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:51:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:51:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:51:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:51:14,350 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-12 03:51:16,373 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-12 03:51:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:51:19,898 INFO L93 Difference]: Finished difference Result 1583 states and 2264 transitions. [2022-07-12 03:51:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:51:19,901 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-12 03:51:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:51:19,903 INFO L225 Difference]: With dead ends: 1583 [2022-07-12 03:51:19,903 INFO L226 Difference]: Without dead ends: 802 [2022-07-12 03:51:19,904 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-12 03:51:19,904 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:51:19,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 1 Unknown, 22 Unchecked, 5.5s Time] [2022-07-12 03:51:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-12 03:51:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-12 03:51:19,916 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-12 03:51:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1125 transitions. [2022-07-12 03:51:19,917 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1125 transitions. Word has length 118 [2022-07-12 03:51:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:51:19,918 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1125 transitions. [2022-07-12 03:51:19,918 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-12 03:51:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1125 transitions. [2022-07-12 03:51:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 03:51:19,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:51:19,919 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-12 03:51:19,955 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-12 03:51:20,139 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-12 03:51:20,140 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:51:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:51:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1012937024, now seen corresponding path program 1 times [2022-07-12 03:51:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:51:20,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245107838] [2022-07-12 03:51:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:51:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:51:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:51:20,145 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-12 03:51:20,147 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-12 03:51:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:51:21,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:51:21,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:51:22,458 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 03:51:22,459 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-12 03:51:22,638 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:51:22,638 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-12 03:51:22,675 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-12 03:51:22,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:51:22,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:51:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245107838] [2022-07-12 03:51:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245107838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:51:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:51:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:51:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222797907] [2022-07-12 03:51:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:51:22,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:51:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:51:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:51:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:51:22,676 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-12 03:51:24,704 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-12 03:51:27,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:51:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:51:29,782 INFO L93 Difference]: Finished difference Result 1583 states and 2256 transitions. [2022-07-12 03:51:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:51:29,785 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-12 03:51:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:51:29,786 INFO L225 Difference]: With dead ends: 1583 [2022-07-12 03:51:29,786 INFO L226 Difference]: Without dead ends: 802 [2022-07-12 03:51:29,787 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-12 03:51:29,788 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:51:29,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 24 Unchecked, 7.1s Time] [2022-07-12 03:51:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-12 03:51:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-12 03:51:29,814 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-12 03:51:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1121 transitions. [2022-07-12 03:51:29,815 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1121 transitions. Word has length 119 [2022-07-12 03:51:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:51:29,815 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1121 transitions. [2022-07-12 03:51:29,815 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-12 03:51:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1121 transitions. [2022-07-12 03:51:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 03:51:29,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:51:29,817 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-12 03:51:29,844 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-12 03:51:30,035 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-12 03:51:30,036 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:51:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:51:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash 405159276, now seen corresponding path program 1 times [2022-07-12 03:51:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:51:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33488468] [2022-07-12 03:51:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:51:30,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:51:30,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:51:30,038 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-12 03:51:30,039 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-12 03:51:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:51:31,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:51:31,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:51:32,191 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-12 03:51:32,191 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-12 03:51:32,337 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-12 03:51:32,337 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-12 03:51:32,371 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-12 03:51:32,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:51:32,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:51:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33488468] [2022-07-12 03:51:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33488468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:51:32,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:51:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:51:32,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595338977] [2022-07-12 03:51:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:51:32,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:51:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:51:32,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:51:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:51:32,374 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-12 03:51:34,406 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-12 03:51:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:51:38,453 INFO L93 Difference]: Finished difference Result 1569 states and 2231 transitions. [2022-07-12 03:51:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:51:38,456 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-12 03:51:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:51:38,458 INFO L225 Difference]: With dead ends: 1569 [2022-07-12 03:51:38,458 INFO L226 Difference]: Without dead ends: 788 [2022-07-12 03:51:38,459 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-12 03:51:38,460 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:51:38,460 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.0s Time] [2022-07-12 03:51:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-12 03:51:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-12 03:51:38,470 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-12 03:51:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1117 transitions. [2022-07-12 03:51:38,472 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1117 transitions. Word has length 119 [2022-07-12 03:51:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:51:38,472 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1117 transitions. [2022-07-12 03:51:38,472 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-12 03:51:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1117 transitions. [2022-07-12 03:51:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 03:51:38,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:51:38,474 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-12 03:51:38,509 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-12 03:51:38,699 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-12 03:51:38,700 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:51:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:51:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-12 03:51:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:51:38,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554608856] [2022-07-12 03:51:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:51:38,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:51:38,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:51:38,703 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-12 03:51:38,705 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-12 03:51:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:51:41,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:51:41,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:51:41,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:51:41,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:41,536 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-12 03:51:43,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:44,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:51:44,042 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-12 03:51:44,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:51:44,653 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-12 03:51:44,702 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-12 03:51:44,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:51:44,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:51:44,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554608856] [2022-07-12 03:51:44,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554608856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:51:44,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:51:44,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:51:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747684346] [2022-07-12 03:51:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:51:44,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:51:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:51:44,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:51:44,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:51:44,703 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-12 03:51:46,722 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-12 03:51:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:51:46,755 INFO L93 Difference]: Finished difference Result 1419 states and 2013 transitions. [2022-07-12 03:51:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:51:46,756 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-12 03:51:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:51:46,758 INFO L225 Difference]: With dead ends: 1419 [2022-07-12 03:51:46,758 INFO L226 Difference]: Without dead ends: 801 [2022-07-12 03:51:46,758 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-12 03:51:46,759 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:51:46,760 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.0s Time] [2022-07-12 03:51:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-07-12 03:51:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2022-07-12 03:51:46,778 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-12 03:51:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1135 transitions. [2022-07-12 03:51:46,779 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1135 transitions. Word has length 122 [2022-07-12 03:51:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:51:46,780 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1135 transitions. [2022-07-12 03:51:46,780 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-12 03:51:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1135 transitions. [2022-07-12 03:51:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 03:51:46,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:51:46,781 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] [2022-07-12 03:51:46,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 03:51:46,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:51:46,996 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:51:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:51:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash 787843816, now seen corresponding path program 1 times [2022-07-12 03:51:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:51:46,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443628115] [2022-07-12 03:51:46,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:51:46,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:51:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:51:46,998 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:51:46,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 03:51:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:51:49,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:51:49,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:51:49,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:51:49,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:49,619 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-12 03:51:51,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:51,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:52,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:51:52,112 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-12 03:51:52,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:51:52,809 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-12 03:51:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-12 03:51:52,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:51:52,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:51:52,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443628115] [2022-07-12 03:51:52,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443628115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:51:52,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:51:52,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:51:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117588589] [2022-07-12 03:51:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:51:52,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:51:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:51:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:51:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:51:52,853 INFO L87 Difference]: Start difference. First operand 799 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:51:54,882 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-12 03:51:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:51:54,929 INFO L93 Difference]: Finished difference Result 1420 states and 2014 transitions. [2022-07-12 03:51:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:51:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-12 03:51:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:51:54,932 INFO L225 Difference]: With dead ends: 1420 [2022-07-12 03:51:54,932 INFO L226 Difference]: Without dead ends: 802 [2022-07-12 03:51:54,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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-12 03:51:54,933 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 8 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 401 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-12 03:51:54,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 401 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.1s Time] [2022-07-12 03:51:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-12 03:51:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2022-07-12 03:51:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.4217772215269087) internal successors, (1136), 799 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-12 03:51:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1136 transitions. [2022-07-12 03:51:54,961 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1136 transitions. Word has length 123 [2022-07-12 03:51:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:51:54,961 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1136 transitions. [2022-07-12 03:51:54,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:51:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1136 transitions. [2022-07-12 03:51:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 03:51:54,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:51:54,963 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, 1] [2022-07-12 03:51:55,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 03:51:55,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:51:55,176 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:51:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:51:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1698524401, now seen corresponding path program 1 times [2022-07-12 03:51:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:51:55,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796742839] [2022-07-12 03:51:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:51:55,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:51:55,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:51:55,178 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:51:55,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 03:51:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:51:58,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:51:58,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:51:58,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:51:58,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:51:58,494 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-12 03:52:00,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:00,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:01,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:52:01,091 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-12 03:52:01,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:52:01,637 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-12 03:52:01,674 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-12 03:52:01,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:52:01,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:52:01,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796742839] [2022-07-12 03:52:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796742839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:52:01,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:52:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:52:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373098419] [2022-07-12 03:52:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:52:01,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:52:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:52:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:52:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:52:01,677 INFO L87 Difference]: Start difference. First operand 800 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:52:03,704 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-12 03:52:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:52:05,830 INFO L93 Difference]: Finished difference Result 1428 states and 2027 transitions. [2022-07-12 03:52:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:52:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-12 03:52:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:52:05,833 INFO L225 Difference]: With dead ends: 1428 [2022-07-12 03:52:05,833 INFO L226 Difference]: Without dead ends: 810 [2022-07-12 03:52:05,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:52:05,834 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:52:05,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 436 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 102 Unchecked, 2.1s Time] [2022-07-12 03:52:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-12 03:52:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2022-07-12 03:52:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.4237918215613383) internal successors, (1149), 807 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:52:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1149 transitions. [2022-07-12 03:52:05,847 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1149 transitions. Word has length 123 [2022-07-12 03:52:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:52:05,847 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1149 transitions. [2022-07-12 03:52:05,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:52:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1149 transitions. [2022-07-12 03:52:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 03:52:05,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:52:05,849 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, 1] [2022-07-12 03:52:05,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 03:52:06,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:52:06,064 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:52:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:52:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash -935560660, now seen corresponding path program 1 times [2022-07-12 03:52:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:52:06,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221141587] [2022-07-12 03:52:06,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:52:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:52:06,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:52:06,066 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:52:06,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 03:52:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:52:08,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:52:08,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:52:08,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:52:08,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:08,969 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-12 03:52:11,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:52:11,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:52:11,487 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-12 03:52:12,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:52:12,139 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-12 03:52:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-12 03:52:12,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:52:12,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:52:12,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221141587] [2022-07-12 03:52:12,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221141587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:52:12,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:52:12,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:52:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562688838] [2022-07-12 03:52:12,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:52:12,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:52:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:52:12,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:52:12,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:52:12,182 INFO L87 Difference]: Start difference. First operand 808 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:52:14,207 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-12 03:52:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:52:14,251 INFO L93 Difference]: Finished difference Result 1429 states and 2028 transitions. [2022-07-12 03:52:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:52:14,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-07-12 03:52:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:52:14,263 INFO L225 Difference]: With dead ends: 1429 [2022-07-12 03:52:14,263 INFO L226 Difference]: Without dead ends: 811 [2022-07-12 03:52:14,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 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-12 03:52:14,264 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:52:14,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 436 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 101 Unchecked, 2.1s Time] [2022-07-12 03:52:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-07-12 03:52:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 797. [2022-07-12 03:52:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.420854271356784) internal successors, (1131), 796 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:52:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1131 transitions. [2022-07-12 03:52:14,281 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1131 transitions. Word has length 124 [2022-07-12 03:52:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:52:14,281 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1131 transitions. [2022-07-12 03:52:14,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:52:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1131 transitions. [2022-07-12 03:52:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 03:52:14,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:52:14,285 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-12 03:52:14,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 03:52:14,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:52:14,512 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:52:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:52:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-12 03:52:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:52:14,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369869128] [2022-07-12 03:52:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:52:14,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:52:14,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:52:14,514 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:52:14,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process