./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:51:12,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:51:12,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:51:12,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:51:12,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:51:12,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:51:12,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:51:12,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:51:12,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:51:12,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:51:12,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:51:12,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:51:12,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:51:12,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:51:12,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:51:12,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:51:12,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:51:12,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:51:12,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:51:12,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:51:12,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:51:12,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:51:12,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:51:12,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:51:12,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:51:12,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:51:12,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:51:12,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:51:12,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:51:12,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:51:12,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:51:12,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:51:12,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:51:12,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:51:12,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:51:12,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:51:12,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:51:12,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:51:12,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:51:12,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:51:12,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:51:12,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 05:51:12,460 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:51:12,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:51:12,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:51:12,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:51:12,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:51:12,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:51:12,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:51:12,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:51:12,464 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:51:12,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:51:12,465 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:51:12,465 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:51:12,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:51:12,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:51:12,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:51:12,466 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:51:12,466 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:51:12,466 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:51:12,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:51:12,467 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:51:12,467 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:51:12,467 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:51:12,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:51:12,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:51:12,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:51:12,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:51:12,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:51:12,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:51:12,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:51:12,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:51:12,478 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2021-12-28 05:51:12,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:51:12,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:51:12,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:51:12,831 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:51:12,831 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:51:12,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-12-28 05:51:12,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cec7f4d/1064f4478c5045f0a71d02cd08def9ae/FLAG9daf58b2b [2021-12-28 05:51:13,407 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:51:13,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-12-28 05:51:13,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cec7f4d/1064f4478c5045f0a71d02cd08def9ae/FLAG9daf58b2b [2021-12-28 05:51:13,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cec7f4d/1064f4478c5045f0a71d02cd08def9ae [2021-12-28 05:51:13,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:51:13,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:51:13,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:51:13,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:51:13,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:51:13,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:51:13" (1/1) ... [2021-12-28 05:51:13,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81f6540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:13, skipping insertion in model container [2021-12-28 05:51:13,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:51:13" (1/1) ... [2021-12-28 05:51:13,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:51:13,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:51:14,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:51:14,223 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:51:14,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:51:14,290 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:51:14,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14 WrapperNode [2021-12-28 05:51:14,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:51:14,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:51:14,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:51:14,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:51:14,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,332 INFO L137 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 142 [2021-12-28 05:51:14,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:51:14,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:51:14,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:51:14,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:51:14,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:51:14,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:51:14,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:51:14,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:51:14,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (1/1) ... [2021-12-28 05:51:14,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:51:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:14,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:51:14,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:51:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:51:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:51:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:51:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:51:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:51:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:51:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:51:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:51:14,547 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:51:14,549 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:51:15,017 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:51:15,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:51:15,023 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-28 05:51:15,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:51:15 BoogieIcfgContainer [2021-12-28 05:51:15,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:51:15,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:51:15,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:51:15,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:51:15,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:51:13" (1/3) ... [2021-12-28 05:51:15,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291427eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:51:15, skipping insertion in model container [2021-12-28 05:51:15,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:51:14" (2/3) ... [2021-12-28 05:51:15,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291427eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:51:15, skipping insertion in model container [2021-12-28 05:51:15,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:51:15" (3/3) ... [2021-12-28 05:51:15,031 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2021-12-28 05:51:15,049 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:51:15,049 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2021-12-28 05:51:15,095 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:51:15,105 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:51:15,105 INFO L340 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2021-12-28 05:51:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:51:15,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:15,138 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:51:15,139 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:15,166 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:51:15,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:15,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382648316] [2021-12-28 05:51:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:15,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:15,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:15,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382648316] [2021-12-28 05:51:15,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382648316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:15,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:15,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:51:15,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410821830] [2021-12-28 05:51:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:15,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:51:15,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:51:15,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:15,342 INFO L87 Difference]: Start difference. First operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 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, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:15,514 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2021-12-28 05:51:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:51:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-28 05:51:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:15,524 INFO L225 Difference]: With dead ends: 156 [2021-12-28 05:51:15,524 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:51:15,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:15,528 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 104 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:15,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 122 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:51:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2021-12-28 05:51:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2021-12-28 05:51:15,589 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 3 [2021-12-28 05:51:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:15,590 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2021-12-28 05:51:15,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2021-12-28 05:51:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:51:15,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:15,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:51:15,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:51:15,592 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:51:15,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:15,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382927501] [2021-12-28 05:51:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:15,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:15,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382927501] [2021-12-28 05:51:15,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382927501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:15,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:15,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:51:15,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655001954] [2021-12-28 05:51:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:15,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:51:15,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:15,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:51:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:15,675 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:15,785 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2021-12-28 05:51:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:51:15,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-28 05:51:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:15,786 INFO L225 Difference]: With dead ends: 132 [2021-12-28 05:51:15,787 INFO L226 Difference]: Without dead ends: 132 [2021-12-28 05:51:15,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:15,795 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:15,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-28 05:51:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-12-28 05:51:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2021-12-28 05:51:15,805 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 3 [2021-12-28 05:51:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:15,806 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2021-12-28 05:51:15,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2021-12-28 05:51:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-28 05:51:15,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:15,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:15,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:51:15,807 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2021-12-28 05:51:15,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:15,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509617753] [2021-12-28 05:51:15,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:15,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:15,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:15,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509617753] [2021-12-28 05:51:15,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509617753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:15,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:15,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:51:15,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974802974] [2021-12-28 05:51:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:15,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:51:15,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:15,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:51:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:51:15,878 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:16,054 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2021-12-28 05:51:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:51:16,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-28 05:51:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:16,057 INFO L225 Difference]: With dead ends: 140 [2021-12-28 05:51:16,057 INFO L226 Difference]: Without dead ends: 140 [2021-12-28 05:51:16,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:16,062 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 174 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:16,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 96 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-28 05:51:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2021-12-28 05:51:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2021-12-28 05:51:16,069 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 7 [2021-12-28 05:51:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:16,070 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2021-12-28 05:51:16,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2021-12-28 05:51:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-28 05:51:16,070 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:16,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:16,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:51:16,071 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2021-12-28 05:51:16,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:16,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619252725] [2021-12-28 05:51:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:16,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:16,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:16,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619252725] [2021-12-28 05:51:16,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619252725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:16,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:16,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:51:16,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348657821] [2021-12-28 05:51:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:16,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:51:16,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:51:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:51:16,133 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:16,308 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2021-12-28 05:51:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:51:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-28 05:51:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:16,311 INFO L225 Difference]: With dead ends: 163 [2021-12-28 05:51:16,311 INFO L226 Difference]: Without dead ends: 163 [2021-12-28 05:51:16,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:16,315 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 213 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:16,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 116 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:51:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-28 05:51:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2021-12-28 05:51:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2021-12-28 05:51:16,324 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 7 [2021-12-28 05:51:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:16,324 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2021-12-28 05:51:16,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2021-12-28 05:51:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:51:16,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:16,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:16,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:51:16,326 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash 59388299, now seen corresponding path program 1 times [2021-12-28 05:51:16,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:16,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596711686] [2021-12-28 05:51:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:16,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:16,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:16,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596711686] [2021-12-28 05:51:16,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596711686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:16,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:16,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:51:16,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618220500] [2021-12-28 05:51:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:16,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:51:16,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:16,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:51:16,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:16,374 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:16,450 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2021-12-28 05:51:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:51:16,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-28 05:51:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:16,452 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:51:16,452 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:51:16,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:16,453 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:16,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 180 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:51:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2021-12-28 05:51:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2021-12-28 05:51:16,459 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 8 [2021-12-28 05:51:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:16,459 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2021-12-28 05:51:16,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2021-12-28 05:51:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:51:16,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:16,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:16,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:51:16,461 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 59388300, now seen corresponding path program 1 times [2021-12-28 05:51:16,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:16,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267017721] [2021-12-28 05:51:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:16,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:16,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:16,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267017721] [2021-12-28 05:51:16,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267017721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:16,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:16,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:51:16,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769395079] [2021-12-28 05:51:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:16,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:51:16,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:51:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:16,501 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:16,582 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2021-12-28 05:51:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:51:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-28 05:51:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:16,583 INFO L225 Difference]: With dead ends: 150 [2021-12-28 05:51:16,583 INFO L226 Difference]: Without dead ends: 150 [2021-12-28 05:51:16,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:16,585 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:16,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 172 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-28 05:51:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2021-12-28 05:51:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2021-12-28 05:51:16,591 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 8 [2021-12-28 05:51:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:16,591 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2021-12-28 05:51:16,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2021-12-28 05:51:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:51:16,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:16,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:16,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:51:16,593 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -387876619, now seen corresponding path program 1 times [2021-12-28 05:51:16,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:16,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940173745] [2021-12-28 05:51:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:16,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:16,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940173745] [2021-12-28 05:51:16,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940173745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:16,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:16,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:51:16,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944200266] [2021-12-28 05:51:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:16,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:51:16,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:16,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:51:16,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:16,634 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:16,651 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2021-12-28 05:51:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:51:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-28 05:51:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:16,652 INFO L225 Difference]: With dead ends: 147 [2021-12-28 05:51:16,652 INFO L226 Difference]: Without dead ends: 147 [2021-12-28 05:51:16,653 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:51:16,653 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:16,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 228 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:51:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-28 05:51:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2021-12-28 05:51:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2021-12-28 05:51:16,658 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 12 [2021-12-28 05:51:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:16,658 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2021-12-28 05:51:16,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2021-12-28 05:51:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 05:51:16,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:16,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:16,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:51:16,660 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:16,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash 860725951, now seen corresponding path program 1 times [2021-12-28 05:51:16,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:16,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312958768] [2021-12-28 05:51:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:16,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:16,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:16,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312958768] [2021-12-28 05:51:16,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312958768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:16,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:16,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:16,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660473405] [2021-12-28 05:51:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:16,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:16,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:16,746 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:16,853 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2021-12-28 05:51:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:51:16,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-28 05:51:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:16,854 INFO L225 Difference]: With dead ends: 159 [2021-12-28 05:51:16,854 INFO L226 Difference]: Without dead ends: 159 [2021-12-28 05:51:16,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:16,855 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 57 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:16,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 216 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-28 05:51:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-12-28 05:51:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2021-12-28 05:51:16,860 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 13 [2021-12-28 05:51:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:16,860 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2021-12-28 05:51:16,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2021-12-28 05:51:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 05:51:16,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:16,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:16,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:51:16,862 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:16,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 860725952, now seen corresponding path program 1 times [2021-12-28 05:51:16,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:16,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973500270] [2021-12-28 05:51:16,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:16,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:16,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:16,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973500270] [2021-12-28 05:51:16,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973500270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:16,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:16,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:51:16,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030713472] [2021-12-28 05:51:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:16,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:51:16,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:51:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:51:16,917 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:17,062 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2021-12-28 05:51:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:51:17,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-28 05:51:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:17,063 INFO L225 Difference]: With dead ends: 182 [2021-12-28 05:51:17,063 INFO L226 Difference]: Without dead ends: 182 [2021-12-28 05:51:17,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:17,064 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:17,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-28 05:51:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2021-12-28 05:51:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2021-12-28 05:51:17,069 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 13 [2021-12-28 05:51:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:17,069 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2021-12-28 05:51:17,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2021-12-28 05:51:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:51:17,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:17,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:17,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:51:17,071 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:17,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2021-12-28 05:51:17,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:17,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383294964] [2021-12-28 05:51:17,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:17,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:17,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383294964] [2021-12-28 05:51:17,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383294964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:17,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:17,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:51:17,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965830177] [2021-12-28 05:51:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:17,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:51:17,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:51:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:51:17,132 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:17,144 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2021-12-28 05:51:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:51:17,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-28 05:51:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:17,145 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:51:17,145 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:51:17,146 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:51:17,146 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:17,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:51:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:51:17,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-28 05:51:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2021-12-28 05:51:17,153 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 14 [2021-12-28 05:51:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:17,153 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2021-12-28 05:51:17,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-12-28 05:51:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:51:17,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:17,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:17,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:51:17,155 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:17,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash 932171324, now seen corresponding path program 1 times [2021-12-28 05:51:17,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:17,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402605846] [2021-12-28 05:51:17,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:17,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:17,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402605846] [2021-12-28 05:51:17,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402605846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:17,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:17,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:17,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746531215] [2021-12-28 05:51:17,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:17,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:17,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:17,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:17,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:17,220 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:17,284 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2021-12-28 05:51:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:51:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-28 05:51:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:17,286 INFO L225 Difference]: With dead ends: 166 [2021-12-28 05:51:17,286 INFO L226 Difference]: Without dead ends: 166 [2021-12-28 05:51:17,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:51:17,287 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:17,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 270 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-28 05:51:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2021-12-28 05:51:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2021-12-28 05:51:17,294 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 16 [2021-12-28 05:51:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:17,295 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2021-12-28 05:51:17,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2021-12-28 05:51:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:51:17,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:17,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:17,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:51:17,298 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2021-12-28 05:51:17,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:17,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828524983] [2021-12-28 05:51:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:17,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:17,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:17,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828524983] [2021-12-28 05:51:17,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828524983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:17,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:17,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:51:17,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792439628] [2021-12-28 05:51:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:17,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:51:17,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:17,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:51:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:51:17,409 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:17,562 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2021-12-28 05:51:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:51:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-12-28 05:51:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:17,563 INFO L225 Difference]: With dead ends: 189 [2021-12-28 05:51:17,563 INFO L226 Difference]: Without dead ends: 189 [2021-12-28 05:51:17,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:51:17,564 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 49 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:17,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 436 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-28 05:51:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2021-12-28 05:51:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2021-12-28 05:51:17,568 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 16 [2021-12-28 05:51:17,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:17,568 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2021-12-28 05:51:17,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2021-12-28 05:51:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:51:17,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:17,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:17,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:51:17,569 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:17,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516449, now seen corresponding path program 1 times [2021-12-28 05:51:17,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:17,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895550677] [2021-12-28 05:51:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:17,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:17,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:17,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895550677] [2021-12-28 05:51:17,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895550677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:17,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:17,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 05:51:17,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007044989] [2021-12-28 05:51:17,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:17,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:51:17,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:51:17,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:51:17,768 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:18,186 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2021-12-28 05:51:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:51:18,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-12-28 05:51:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:18,188 INFO L225 Difference]: With dead ends: 188 [2021-12-28 05:51:18,188 INFO L226 Difference]: Without dead ends: 188 [2021-12-28 05:51:18,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-28 05:51:18,189 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 186 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:18,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 316 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:51:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-28 05:51:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2021-12-28 05:51:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2021-12-28 05:51:18,193 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 18 [2021-12-28 05:51:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:18,193 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2021-12-28 05:51:18,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2021-12-28 05:51:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:51:18,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:18,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:18,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:51:18,194 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516448, now seen corresponding path program 1 times [2021-12-28 05:51:18,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:18,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205836107] [2021-12-28 05:51:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:18,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:18,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205836107] [2021-12-28 05:51:18,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205836107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:18,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:18,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 05:51:18,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456480794] [2021-12-28 05:51:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:18,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:51:18,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:51:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:51:18,382 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:19,007 INFO L93 Difference]: Finished difference Result 230 states and 266 transitions. [2021-12-28 05:51:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:51:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-12-28 05:51:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:19,009 INFO L225 Difference]: With dead ends: 230 [2021-12-28 05:51:19,009 INFO L226 Difference]: Without dead ends: 230 [2021-12-28 05:51:19,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-12-28 05:51:19,010 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 423 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:19,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 324 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:51:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-28 05:51:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 187. [2021-12-28 05:51:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2021-12-28 05:51:19,015 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 18 [2021-12-28 05:51:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:19,015 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2021-12-28 05:51:19,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2021-12-28 05:51:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:51:19,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:19,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:19,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:51:19,017 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2021-12-28 05:51:19,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048865686] [2021-12-28 05:51:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:19,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:19,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:19,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048865686] [2021-12-28 05:51:19,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048865686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:19,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:19,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:19,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383033957] [2021-12-28 05:51:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:19,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:19,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:19,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:19,057 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:19,178 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2021-12-28 05:51:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:51:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-12-28 05:51:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:19,179 INFO L225 Difference]: With dead ends: 186 [2021-12-28 05:51:19,179 INFO L226 Difference]: Without dead ends: 186 [2021-12-28 05:51:19,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:51:19,180 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:19,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 273 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-28 05:51:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-12-28 05:51:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2021-12-28 05:51:19,184 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 18 [2021-12-28 05:51:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:19,184 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2021-12-28 05:51:19,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2021-12-28 05:51:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:51:19,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:19,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:19,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:51:19,185 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2021-12-28 05:51:19,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:19,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289082054] [2021-12-28 05:51:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:19,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:19,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:19,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289082054] [2021-12-28 05:51:19,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289082054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:19,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:19,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:19,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082094418] [2021-12-28 05:51:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:19,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:19,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:19,234 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:19,367 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2021-12-28 05:51:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:51:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-12-28 05:51:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:19,369 INFO L225 Difference]: With dead ends: 185 [2021-12-28 05:51:19,369 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 05:51:19,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:51:19,369 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:19,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 255 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 05:51:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-12-28 05:51:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2021-12-28 05:51:19,373 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 18 [2021-12-28 05:51:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:19,373 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2021-12-28 05:51:19,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2021-12-28 05:51:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:51:19,374 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:19,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:19,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:51:19,375 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:19,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2021-12-28 05:51:19,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:19,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049759038] [2021-12-28 05:51:19,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:19,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:19,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:19,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049759038] [2021-12-28 05:51:19,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049759038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:19,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:19,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:51:19,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400316837] [2021-12-28 05:51:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:19,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:51:19,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:51:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:51:19,450 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:19,678 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2021-12-28 05:51:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:51:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-12-28 05:51:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:19,679 INFO L225 Difference]: With dead ends: 187 [2021-12-28 05:51:19,679 INFO L226 Difference]: Without dead ends: 187 [2021-12-28 05:51:19,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:51:19,680 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 75 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:19,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 254 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:51:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-28 05:51:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2021-12-28 05:51:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2021-12-28 05:51:19,683 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 21 [2021-12-28 05:51:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:19,684 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2021-12-28 05:51:19,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2021-12-28 05:51:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:51:19,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:19,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:19,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:51:19,685 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2021-12-28 05:51:19,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:19,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973414299] [2021-12-28 05:51:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:19,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:19,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:19,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973414299] [2021-12-28 05:51:19,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973414299] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:19,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:19,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:51:19,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442021453] [2021-12-28 05:51:19,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:19,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:51:19,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:51:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:51:19,789 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:20,058 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2021-12-28 05:51:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:51:20,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-12-28 05:51:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:20,059 INFO L225 Difference]: With dead ends: 186 [2021-12-28 05:51:20,059 INFO L226 Difference]: Without dead ends: 186 [2021-12-28 05:51:20,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:51:20,060 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 76 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:20,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 254 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:51:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-28 05:51:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2021-12-28 05:51:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2021-12-28 05:51:20,064 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 21 [2021-12-28 05:51:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:20,064 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2021-12-28 05:51:20,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2021-12-28 05:51:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:51:20,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:20,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:20,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:51:20,065 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2021-12-28 05:51:20,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:20,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162931486] [2021-12-28 05:51:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:20,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:20,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:20,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162931486] [2021-12-28 05:51:20,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162931486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:20,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:20,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:20,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542273184] [2021-12-28 05:51:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:20,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:20,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:20,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:20,103 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:20,222 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2021-12-28 05:51:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:51:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-28 05:51:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:20,223 INFO L225 Difference]: With dead ends: 182 [2021-12-28 05:51:20,223 INFO L226 Difference]: Without dead ends: 182 [2021-12-28 05:51:20,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:51:20,224 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:20,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-28 05:51:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-28 05:51:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2021-12-28 05:51:20,228 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 22 [2021-12-28 05:51:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:20,228 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2021-12-28 05:51:20,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2021-12-28 05:51:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:51:20,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:20,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:20,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:51:20,229 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2021-12-28 05:51:20,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:20,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189505764] [2021-12-28 05:51:20,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:20,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:20,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:20,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189505764] [2021-12-28 05:51:20,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189505764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:20,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:20,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:20,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340268456] [2021-12-28 05:51:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:20,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:20,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:20,307 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:20,447 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2021-12-28 05:51:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:51:20,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-28 05:51:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:20,449 INFO L225 Difference]: With dead ends: 181 [2021-12-28 05:51:20,449 INFO L226 Difference]: Without dead ends: 181 [2021-12-28 05:51:20,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:51:20,449 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:20,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 245 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-28 05:51:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-28 05:51:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2021-12-28 05:51:20,453 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 22 [2021-12-28 05:51:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:20,453 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2021-12-28 05:51:20,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2021-12-28 05:51:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 05:51:20,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:20,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:20,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:51:20,454 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:20,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash -496178395, now seen corresponding path program 1 times [2021-12-28 05:51:20,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:20,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123516842] [2021-12-28 05:51:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:20,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:20,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:20,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123516842] [2021-12-28 05:51:20,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123516842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:20,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:20,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:51:20,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455650795] [2021-12-28 05:51:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:20,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:51:20,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:51:20,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:51:20,571 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:20,894 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2021-12-28 05:51:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:51:20,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-12-28 05:51:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:20,896 INFO L225 Difference]: With dead ends: 199 [2021-12-28 05:51:20,896 INFO L226 Difference]: Without dead ends: 199 [2021-12-28 05:51:20,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:51:20,896 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 273 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:20,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 433 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:51:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-28 05:51:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 183. [2021-12-28 05:51:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2021-12-28 05:51:20,900 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2021-12-28 05:51:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:20,900 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2021-12-28 05:51:20,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2021-12-28 05:51:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:51:20,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:20,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:20,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 05:51:20,901 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:20,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2021-12-28 05:51:20,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:20,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848469203] [2021-12-28 05:51:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:20,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:20,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:20,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848469203] [2021-12-28 05:51:20,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848469203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:20,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:20,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:51:20,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412347311] [2021-12-28 05:51:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:20,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:51:20,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:51:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:51:20,966 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:21,196 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2021-12-28 05:51:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:51:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-28 05:51:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:21,198 INFO L225 Difference]: With dead ends: 185 [2021-12-28 05:51:21,198 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 05:51:21,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:51:21,199 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:21,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 244 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:51:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 05:51:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2021-12-28 05:51:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2021-12-28 05:51:21,203 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 25 [2021-12-28 05:51:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:21,203 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2021-12-28 05:51:21,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2021-12-28 05:51:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:51:21,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:21,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:21,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 05:51:21,204 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2021-12-28 05:51:21,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129955470] [2021-12-28 05:51:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:21,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:21,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:21,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129955470] [2021-12-28 05:51:21,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129955470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:21,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:21,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:51:21,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899393891] [2021-12-28 05:51:21,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:21,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:51:21,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:21,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:51:21,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:51:21,291 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:21,573 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2021-12-28 05:51:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:51:21,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-28 05:51:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:21,575 INFO L225 Difference]: With dead ends: 184 [2021-12-28 05:51:21,575 INFO L226 Difference]: Without dead ends: 184 [2021-12-28 05:51:21,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:51:21,575 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:21,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 292 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:51:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-28 05:51:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2021-12-28 05:51:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2021-12-28 05:51:21,578 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 25 [2021-12-28 05:51:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:21,578 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2021-12-28 05:51:21,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2021-12-28 05:51:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:51:21,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:21,579 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:21,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 05:51:21,579 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:21,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1627096903, now seen corresponding path program 1 times [2021-12-28 05:51:21,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:21,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233673530] [2021-12-28 05:51:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:21,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:21,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:21,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233673530] [2021-12-28 05:51:21,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233673530] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675642283] [2021-12-28 05:51:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:21,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:21,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:51:21,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:51:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:21,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 05:51:21,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:21,837 INFO L387 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:21,842 INFO L387 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:21,882 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:51:21,883 INFO L387 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:51:21,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:21,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:51:21,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:51:21,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:51:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:21,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:22,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675642283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:51:22,091 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:51:22,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2021-12-28 05:51:22,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459110458] [2021-12-28 05:51:22,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:51:22,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:51:22,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:22,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:51:22,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:51:22,092 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:22,168 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2021-12-28 05:51:22,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:51:22,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-12-28 05:51:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:22,169 INFO L225 Difference]: With dead ends: 187 [2021-12-28 05:51:22,169 INFO L226 Difference]: Without dead ends: 187 [2021-12-28 05:51:22,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:51:22,171 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:22,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 354 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:51:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-28 05:51:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2021-12-28 05:51:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2021-12-28 05:51:22,175 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 26 [2021-12-28 05:51:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:22,175 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2021-12-28 05:51:22,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2021-12-28 05:51:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:51:22,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:22,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:22,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:22,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-28 05:51:22,404 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:22,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1099603412, now seen corresponding path program 1 times [2021-12-28 05:51:22,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:22,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331936325] [2021-12-28 05:51:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:22,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:22,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:22,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331936325] [2021-12-28 05:51:22,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331936325] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:22,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865100344] [2021-12-28 05:51:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:22,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:22,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:22,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:51:22,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 05:51:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:22,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-28 05:51:22,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:22,951 INFO L387 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:23,081 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:23,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2021-12-28 05:51:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:23,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:23,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2021-12-28 05:51:23,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2021-12-28 05:51:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:26,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865100344] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:51:26,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:51:26,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2021-12-28 05:51:26,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552778440] [2021-12-28 05:51:26,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:51:26,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-28 05:51:26,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-28 05:51:26,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=888, Unknown=1, NotChecked=0, Total=992 [2021-12-28 05:51:26,325 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:27,144 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2021-12-28 05:51:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 05:51:27,145 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-28 05:51:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:27,146 INFO L225 Difference]: With dead ends: 207 [2021-12-28 05:51:27,146 INFO L226 Difference]: Without dead ends: 201 [2021-12-28 05:51:27,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=225, Invalid=1580, Unknown=1, NotChecked=0, Total=1806 [2021-12-28 05:51:27,147 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 165 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:27,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 891 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 580 Invalid, 0 Unknown, 354 Unchecked, 0.4s Time] [2021-12-28 05:51:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-28 05:51:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2021-12-28 05:51:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 197 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2021-12-28 05:51:27,151 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 27 [2021-12-28 05:51:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:27,151 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2021-12-28 05:51:27,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2021-12-28 05:51:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-28 05:51:27,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:27,152 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:27,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:27,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-28 05:51:27,364 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -466107059, now seen corresponding path program 1 times [2021-12-28 05:51:27,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:27,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338966468] [2021-12-28 05:51:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:27,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:27,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:27,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338966468] [2021-12-28 05:51:27,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338966468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:27,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:27,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:51:27,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240790977] [2021-12-28 05:51:27,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:27,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:51:27,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:27,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:51:27,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:51:27,424 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:27,608 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2021-12-28 05:51:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:51:27,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-28 05:51:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:27,609 INFO L225 Difference]: With dead ends: 216 [2021-12-28 05:51:27,609 INFO L226 Difference]: Without dead ends: 216 [2021-12-28 05:51:27,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:51:27,610 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 125 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:27,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 189 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:51:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-28 05:51:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2021-12-28 05:51:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 197 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2021-12-28 05:51:27,614 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 30 [2021-12-28 05:51:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:27,614 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2021-12-28 05:51:27,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2021-12-28 05:51:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:51:27,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:27,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:27,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-28 05:51:27,615 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1564416794, now seen corresponding path program 1 times [2021-12-28 05:51:27,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:27,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792290210] [2021-12-28 05:51:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:27,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:27,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792290210] [2021-12-28 05:51:27,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792290210] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:27,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:27,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:51:27,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632807789] [2021-12-28 05:51:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:27,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:51:27,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:51:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:51:27,652 INFO L87 Difference]: Start difference. First operand 198 states and 229 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:27,695 INFO L93 Difference]: Finished difference Result 227 states and 256 transitions. [2021-12-28 05:51:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:51:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-28 05:51:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:27,696 INFO L225 Difference]: With dead ends: 227 [2021-12-28 05:51:27,696 INFO L226 Difference]: Without dead ends: 227 [2021-12-28 05:51:27,697 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:51:27,697 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:27,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 270 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:51:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-28 05:51:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 198. [2021-12-28 05:51:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 197 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 228 transitions. [2021-12-28 05:51:27,701 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 228 transitions. Word has length 31 [2021-12-28 05:51:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:27,702 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 228 transitions. [2021-12-28 05:51:27,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 228 transitions. [2021-12-28 05:51:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 05:51:27,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:27,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:27,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-28 05:51:27,703 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash 821443088, now seen corresponding path program 1 times [2021-12-28 05:51:27,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:27,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2644082] [2021-12-28 05:51:27,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:27,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:27,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:27,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2644082] [2021-12-28 05:51:27,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2644082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:27,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:27,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 05:51:27,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831027775] [2021-12-28 05:51:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:27,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 05:51:27,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 05:51:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:51:27,986 INFO L87 Difference]: Start difference. First operand 198 states and 228 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:28,680 INFO L93 Difference]: Finished difference Result 226 states and 259 transitions. [2021-12-28 05:51:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 05:51:28,681 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-28 05:51:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:28,681 INFO L225 Difference]: With dead ends: 226 [2021-12-28 05:51:28,681 INFO L226 Difference]: Without dead ends: 219 [2021-12-28 05:51:28,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2021-12-28 05:51:28,682 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 213 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:28,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 552 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:51:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-28 05:51:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 196. [2021-12-28 05:51:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 169 states have (on average 1.331360946745562) internal successors, (225), 195 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2021-12-28 05:51:28,686 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 37 [2021-12-28 05:51:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:28,686 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2021-12-28 05:51:28,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2021-12-28 05:51:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 05:51:28,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:28,687 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:28,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-28 05:51:28,687 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash 431036240, now seen corresponding path program 1 times [2021-12-28 05:51:28,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:28,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888293749] [2021-12-28 05:51:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:28,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:28,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:28,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888293749] [2021-12-28 05:51:28,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888293749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:51:28,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:51:28,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:51:28,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435017670] [2021-12-28 05:51:28,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:51:28,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:51:28,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:28,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:51:28,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:51:28,934 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:29,507 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2021-12-28 05:51:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 05:51:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-28 05:51:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:29,508 INFO L225 Difference]: With dead ends: 222 [2021-12-28 05:51:29,508 INFO L226 Difference]: Without dead ends: 197 [2021-12-28 05:51:29,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2021-12-28 05:51:29,509 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 182 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:29,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 574 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:51:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-28 05:51:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2021-12-28 05:51:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3525641025641026) internal successors, (211), 182 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2021-12-28 05:51:29,512 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 37 [2021-12-28 05:51:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:29,512 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2021-12-28 05:51:29,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2021-12-28 05:51:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 05:51:29,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:29,513 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 05:51:29,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-28 05:51:29,513 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2021-12-28 05:51:29,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:29,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189058910] [2021-12-28 05:51:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:29,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:29,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189058910] [2021-12-28 05:51:29,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189058910] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839721457] [2021-12-28 05:51:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:29,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:29,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:51:29,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 05:51:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:29,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 05:51:29,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:30,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:51:30,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:51:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:30,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:30,479 INFO L353 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-28 05:51:30,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-28 05:51:30,491 INFO L353 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-28 05:51:30,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-28 05:51:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:30,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839721457] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:51:30,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:51:30,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 23 [2021-12-28 05:51:30,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117846290] [2021-12-28 05:51:30,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:51:30,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-28 05:51:30,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-28 05:51:30,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-12-28 05:51:30,862 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 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) [2021-12-28 05:51:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:31,437 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2021-12-28 05:51:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 05:51:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 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 38 [2021-12-28 05:51:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:31,439 INFO L225 Difference]: With dead ends: 223 [2021-12-28 05:51:31,439 INFO L226 Difference]: Without dead ends: 223 [2021-12-28 05:51:31,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2021-12-28 05:51:31,440 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 409 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:31,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 872 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 447 Invalid, 0 Unknown, 173 Unchecked, 0.3s Time] [2021-12-28 05:51:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-28 05:51:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2021-12-28 05:51:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 180 states have (on average 1.3277777777777777) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2021-12-28 05:51:31,446 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 38 [2021-12-28 05:51:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:31,447 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2021-12-28 05:51:31,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 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) [2021-12-28 05:51:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2021-12-28 05:51:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 05:51:31,447 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:31,448 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 05:51:31,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:31,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:31,667 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2021-12-28 05:51:31,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:31,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119397605] [2021-12-28 05:51:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:31,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:31,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119397605] [2021-12-28 05:51:31,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119397605] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:31,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348667443] [2021-12-28 05:51:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:31,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:31,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:31,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:51:31,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 05:51:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:32,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-28 05:51:32,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:32,360 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:51:32,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:51:32,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:32,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:51:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:32,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:51:32,545 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:32,546 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-28 05:51:32,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-28 05:51:32,632 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:32,632 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-28 05:51:32,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-28 05:51:32,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-28 05:51:32,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:51:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:32,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:32,800 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_946 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2021-12-28 05:51:32,810 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_946 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2021-12-28 05:51:32,828 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_944))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_947)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_945) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2021-12-28 05:51:32,840 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_945) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_946))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_944))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_947))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2021-12-28 05:51:32,863 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_943 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 v_ArrVal_943)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_945) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_946)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_944))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_947))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2021-12-28 05:51:33,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:33,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:33,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2021-12-28 05:51:33,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:33,367 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:33,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 90 [2021-12-28 05:51:33,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:33,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:33,398 INFO L353 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2021-12-28 05:51:33,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 175 [2021-12-28 05:51:33,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:33,420 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-28 05:51:33,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 214 treesize of output 213 [2021-12-28 05:51:33,430 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 05:51:33,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-28 05:51:33,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 153 [2021-12-28 05:51:33,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 149 [2021-12-28 05:51:33,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 141 [2021-12-28 05:51:33,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2021-12-28 05:51:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:33,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348667443] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:51:33,553 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:51:33,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2021-12-28 05:51:33,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841526910] [2021-12-28 05:51:33,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:51:33,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-28 05:51:33,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:33,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-28 05:51:33,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=673, Unknown=5, NotChecked=290, Total=1122 [2021-12-28 05:51:33,556 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:35,073 INFO L93 Difference]: Finished difference Result 516 states and 608 transitions. [2021-12-28 05:51:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-28 05:51:35,074 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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 38 [2021-12-28 05:51:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:35,075 INFO L225 Difference]: With dead ends: 516 [2021-12-28 05:51:35,075 INFO L226 Difference]: Without dead ends: 516 [2021-12-28 05:51:35,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=544, Invalid=1920, Unknown=6, NotChecked=500, Total=2970 [2021-12-28 05:51:35,077 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 490 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1147 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:35,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 1209 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1034 Invalid, 0 Unknown, 1147 Unchecked, 0.6s Time] [2021-12-28 05:51:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-12-28 05:51:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 242. [2021-12-28 05:51:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3162790697674418) internal successors, (283), 241 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 283 transitions. [2021-12-28 05:51:35,083 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 283 transitions. Word has length 38 [2021-12-28 05:51:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:35,083 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 283 transitions. [2021-12-28 05:51:35,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 283 transitions. [2021-12-28 05:51:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 05:51:35,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:35,084 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:35,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:35,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:35,299 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2021-12-28 05:51:35,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:35,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087577055] [2021-12-28 05:51:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:35,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:35,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:35,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087577055] [2021-12-28 05:51:35,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087577055] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:35,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977828191] [2021-12-28 05:51:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:35,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:35,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:51:35,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 05:51:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:35,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 05:51:35,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:35,865 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:51:35,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:51:35,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:51:36,007 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:36,008 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 05:51:36,074 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:36,075 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 05:51:36,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:36,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2021-12-28 05:51:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:36,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:36,635 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:36,635 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2021-12-28 05:51:36,645 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:36,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 255 [2021-12-28 05:51:36,661 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:36,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 216 [2021-12-28 05:51:36,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 188 [2021-12-28 05:51:40,213 INFO L353 Elim1Store]: treesize reduction 5, result has 97.0 percent of original size [2021-12-28 05:51:40,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 137 treesize of output 286 [2021-12-28 05:51:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:41,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977828191] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:51:41,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:51:41,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 34 [2021-12-28 05:51:41,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999876334] [2021-12-28 05:51:41,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:51:41,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-28 05:51:41,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-28 05:51:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=954, Unknown=26, NotChecked=0, Total=1190 [2021-12-28 05:51:41,453 INFO L87 Difference]: Start difference. First operand 242 states and 283 transitions. Second operand has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:41,960 INFO L93 Difference]: Finished difference Result 452 states and 547 transitions. [2021-12-28 05:51:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:51:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-28 05:51:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:41,962 INFO L225 Difference]: With dead ends: 452 [2021-12-28 05:51:41,962 INFO L226 Difference]: Without dead ends: 452 [2021-12-28 05:51:41,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1090, Unknown=26, NotChecked=0, Total=1406 [2021-12-28 05:51:41,963 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 207 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 777 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:41,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 1375 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 735 Invalid, 0 Unknown, 777 Unchecked, 0.4s Time] [2021-12-28 05:51:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-12-28 05:51:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 373. [2021-12-28 05:51:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 346 states have (on average 1.3208092485549132) internal successors, (457), 372 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 457 transitions. [2021-12-28 05:51:41,970 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 457 transitions. Word has length 46 [2021-12-28 05:51:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:41,970 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 457 transitions. [2021-12-28 05:51:41,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 457 transitions. [2021-12-28 05:51:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 05:51:41,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:41,971 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:42,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:42,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:42,183 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash -659312339, now seen corresponding path program 1 times [2021-12-28 05:51:42,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:42,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223899661] [2021-12-28 05:51:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:42,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:42,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:42,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223899661] [2021-12-28 05:51:42,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223899661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:42,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181164399] [2021-12-28 05:51:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:42,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:42,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:42,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:51:42,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 05:51:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:42,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-28 05:51:42,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:42,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:51:42,749 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:51:42,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:51:42,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:51:42,783 INFO L387 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:51:42,874 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:42,874 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-28 05:51:42,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-28 05:51:42,945 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:42,945 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-28 05:51:42,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-28 05:51:43,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:51:43,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-28 05:51:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:43,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:43,217 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))))) (forall ((v_ArrVal_1177 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2021-12-28 05:51:43,227 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))) (forall ((v_ArrVal_1177 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2021-12-28 05:51:43,248 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1175))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1174) .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))))) is different from false [2021-12-28 05:51:43,262 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1175))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1174) .cse1 v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1176) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1175) |c_ULTIMATE.start_main_~n~0#1.base|) .cse6) v_ArrVal_1177))) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2021-12-28 05:51:43,281 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:43,281 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2021-12-28 05:51:43,286 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:43,287 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2021-12-28 05:51:43,296 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:43,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 400 treesize of output 349 [2021-12-28 05:51:43,312 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:43,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1148 treesize of output 1085 [2021-12-28 05:51:43,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1066 treesize of output 986 [2021-12-28 05:51:43,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 986 treesize of output 906 [2021-12-28 05:51:43,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 906 treesize of output 874 [2021-12-28 05:51:43,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:43,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 874 treesize of output 734 [2021-12-28 05:51:47,281 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:47,282 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2021-12-28 05:51:47,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:47,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 05:51:47,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:47,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-12-28 05:51:47,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:47,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:47,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-28 05:51:47,535 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 05:51:47,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-28 05:51:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:47,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181164399] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:51:47,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:51:47,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2021-12-28 05:51:47,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531555681] [2021-12-28 05:51:47,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:51:47,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-28 05:51:47,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:51:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-28 05:51:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=772, Unknown=4, NotChecked=244, Total=1190 [2021-12-28 05:51:47,643 INFO L87 Difference]: Start difference. First operand 373 states and 457 transitions. Second operand has 35 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 35 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:51:48,773 INFO L93 Difference]: Finished difference Result 692 states and 846 transitions. [2021-12-28 05:51:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 05:51:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 35 states have internal predecessors, (114), 0 states have call successors, (0), 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 46 [2021-12-28 05:51:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:51:48,776 INFO L225 Difference]: With dead ends: 692 [2021-12-28 05:51:48,776 INFO L226 Difference]: Without dead ends: 692 [2021-12-28 05:51:48,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=428, Invalid=1564, Unknown=4, NotChecked=356, Total=2352 [2021-12-28 05:51:48,777 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 881 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:51:48,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 1121 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1159 Invalid, 0 Unknown, 870 Unchecked, 0.6s Time] [2021-12-28 05:51:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-28 05:51:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 443. [2021-12-28 05:51:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 420 states have (on average 1.319047619047619) internal successors, (554), 442 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 554 transitions. [2021-12-28 05:51:48,787 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 554 transitions. Word has length 46 [2021-12-28 05:51:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:51:48,787 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 554 transitions. [2021-12-28 05:51:48,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 35 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:51:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 554 transitions. [2021-12-28 05:51:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 05:51:48,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:51:48,788 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:51:48,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 05:51:49,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:49,003 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2021-12-28 05:51:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:51:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash -659497038, now seen corresponding path program 1 times [2021-12-28 05:51:49,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:51:49,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255922743] [2021-12-28 05:51:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:49,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:51:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:49,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:51:49,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255922743] [2021-12-28 05:51:49,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255922743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:51:49,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503074638] [2021-12-28 05:51:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:51:49,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:51:49,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:51:49,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:51:49,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 05:51:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:51:49,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-28 05:51:49,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:51:49,519 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:51:49,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:51:49,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:51:49,653 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:49,653 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-28 05:51:49,736 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:49,736 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-28 05:51:49,950 INFO L353 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-12-28 05:51:49,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-12-28 05:51:50,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:51:50,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2021-12-28 05:51:50,156 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:50,156 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2021-12-28 05:51:50,282 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:51:50,282 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2021-12-28 05:51:50,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2021-12-28 05:51:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:51:50,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:51:50,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1295)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2021-12-28 05:51:50,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1295))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2021-12-28 05:51:50,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_16| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_16|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_16| 1) (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_16| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1295))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1))) is different from false [2021-12-28 05:51:51,349 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:51,350 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 131 [2021-12-28 05:51:51,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:51,401 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:51,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124790 treesize of output 123658 [2021-12-28 05:51:51,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:51,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125948 treesize of output 124670 [2021-12-28 05:51:54,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:51:54,607 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:51:54,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123412 treesize of output 115698 [2021-12-28 05:51:55,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114898 treesize of output 109266 [2021-12-28 05:51:56,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109266 treesize of output 106450