./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e19ca921 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/forester-heap/dll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:22:30,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:22:30,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:22:30,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:22:30,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:22:30,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:22:30,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:22:30,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:22:30,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:22:30,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:22:30,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:22:30,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:22:30,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:22:30,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:22:30,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:22:30,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:22:30,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:22:30,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:22:30,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:22:30,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:22:30,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:22:30,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:22:30,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:22:30,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:22:30,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:22:30,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:22:30,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:22:30,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:22:30,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:22:30,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:22:30,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:22:30,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:22:30,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:22:30,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:22:30,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:22:30,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:22:30,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:22:30,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:22:30,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:22:30,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:22:30,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:22:30,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-22 16:22:30,474 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:22:30,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:22:30,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:22:30,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:22:30,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:22:30,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:22:30,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:22:30,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:22:30,482 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:22:30,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:22:30,483 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:22:30,483 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:22:30,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:22:30,484 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:22:30,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:22:30,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:22:30,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:22:30,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:22:30,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:22:30,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:22:30,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:22:30,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:22:30,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:22:30,487 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-memcleanup) ) 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 -> 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 [2021-12-22 16:22:30,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:22:30,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:22:30,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:22:30,671 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:22:30,672 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:22:30,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2021-12-22 16:22:30,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8a32fd4/aa009f10eb894f35a5d20d390c1a9bfb/FLAGabb7b5330 [2021-12-22 16:22:31,137 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:22:31,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2021-12-22 16:22:31,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8a32fd4/aa009f10eb894f35a5d20d390c1a9bfb/FLAGabb7b5330 [2021-12-22 16:22:31,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8a32fd4/aa009f10eb894f35a5d20d390c1a9bfb [2021-12-22 16:22:31,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:22:31,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:22:31,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:22:31,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:22:31,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:22:31,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a6572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31, skipping insertion in model container [2021-12-22 16:22:31,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:22:31,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:22:31,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2021-12-22 16:22:31,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2021-12-22 16:22:31,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2021-12-22 16:22:31,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:22:31,615 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:22:31,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2021-12-22 16:22:31,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2021-12-22 16:22:31,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2021-12-22 16:22:31,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:22:31,680 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:22:31,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31 WrapperNode [2021-12-22 16:22:31,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:22:31,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:22:31,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:22:31,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:22:31,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,729 INFO L137 Inliner]: procedures = 119, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2021-12-22 16:22:31,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:22:31,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:22:31,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:22:31,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:22:31,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:22:31,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:22:31,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:22:31,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:22:31,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:22:31,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:22:31,798 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-22 16:22:31,810 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-22 16:22:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:22:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:22:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:22:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:22:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:22:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:22:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:22:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:22:31,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:22:31,894 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:22:31,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:22:32,137 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:22:32,142 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:22:32,142 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-22 16:22:32,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32 BoogieIcfgContainer [2021-12-22 16:22:32,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:22:32,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:22:32,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:22:32,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:22:32,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:22:31" (1/3) ... [2021-12-22 16:22:32,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d0843f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:22:32, skipping insertion in model container [2021-12-22 16:22:32,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31" (2/3) ... [2021-12-22 16:22:32,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d0843f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:22:32, skipping insertion in model container [2021-12-22 16:22:32,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32" (3/3) ... [2021-12-22 16:22:32,150 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2021-12-22 16:22:32,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:22:32,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2021-12-22 16:22:32,187 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:22:32,191 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-22 16:22:32,191 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2021-12-22 16:22:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 58 states have (on average 2.189655172413793) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 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-22 16:22:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:22:32,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:32,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:22:32,206 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:22:32,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:32,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032474696] [2021-12-22 16:22:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:32,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:32,330 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-22 16:22:32,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:32,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032474696] [2021-12-22 16:22:32,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032474696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:32,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:32,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:32,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222454043] [2021-12-22 16:22:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:32,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:32,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:32,364 INFO L87 Difference]: Start difference. First operand has 109 states, 58 states have (on average 2.189655172413793) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 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-22 16:22:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:32,489 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2021-12-22 16:22:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:32,491 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-22 16:22:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:32,499 INFO L225 Difference]: With dead ends: 115 [2021-12-22 16:22:32,499 INFO L226 Difference]: Without dead ends: 113 [2021-12-22 16:22:32,501 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-22 16:22:32,505 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:32,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 80 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-22 16:22:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2021-12-22 16:22:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.912280701754386) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 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-22 16:22:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2021-12-22 16:22:32,542 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 3 [2021-12-22 16:22:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:32,543 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2021-12-22 16:22:32,543 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-22 16:22:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2021-12-22 16:22:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:22:32,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:32,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:22:32,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:22:32,544 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:32,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:22:32,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:32,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369002530] [2021-12-22 16:22:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:32,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:32,603 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-22 16:22:32,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:32,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369002530] [2021-12-22 16:22:32,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369002530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:32,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:32,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:32,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372306146] [2021-12-22 16:22:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:32,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:32,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:32,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:32,611 INFO L87 Difference]: Start difference. First operand 103 states and 109 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-22 16:22:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:32,691 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-22 16:22:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:32,692 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-22 16:22:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:32,695 INFO L225 Difference]: With dead ends: 111 [2021-12-22 16:22:32,696 INFO L226 Difference]: Without dead ends: 111 [2021-12-22 16:22:32,696 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-22 16:22:32,697 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 91 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:32,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 80 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-22 16:22:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2021-12-22 16:22:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 98 states have internal predecessors, (105), 0 states have call successors, (0), 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-22 16:22:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2021-12-22 16:22:32,713 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 3 [2021-12-22 16:22:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:32,714 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2021-12-22 16:22:32,715 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-22 16:22:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2021-12-22 16:22:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:22:32,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:32,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:32,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:22:32,716 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 59263659, now seen corresponding path program 1 times [2021-12-22 16:22:32,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:32,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121153931] [2021-12-22 16:22:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:32,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:32,772 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-22 16:22:32,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:32,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121153931] [2021-12-22 16:22:32,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121153931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:32,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:32,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:32,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320170597] [2021-12-22 16:22:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:32,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:22:32,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:22:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:22:32,775 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 16:22:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:32,852 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2021-12-22 16:22:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:22:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 16:22:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:32,854 INFO L225 Difference]: With dead ends: 96 [2021-12-22 16:22:32,854 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 16:22:32,854 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-22 16:22:32,855 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:32,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 16:22:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2021-12-22 16:22:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 0 states have call successors, (0), 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-22 16:22:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2021-12-22 16:22:32,859 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 8 [2021-12-22 16:22:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:32,859 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2021-12-22 16:22:32,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 16:22:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2021-12-22 16:22:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 16:22:32,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:32,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:32,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:22:32,861 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:32,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash 59263660, now seen corresponding path program 1 times [2021-12-22 16:22:32,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:32,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502627280] [2021-12-22 16:22:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:32,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:32,913 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-22 16:22:32,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:32,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502627280] [2021-12-22 16:22:32,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502627280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:32,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:32,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:32,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710766162] [2021-12-22 16:22:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:32,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:22:32,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:22:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:22:32,917 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 16:22:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,028 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-12-22 16:22:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:22:33,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 16:22:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,031 INFO L225 Difference]: With dead ends: 112 [2021-12-22 16:22:33,031 INFO L226 Difference]: Without dead ends: 112 [2021-12-22 16:22:33,033 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-22 16:22:33,040 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-22 16:22:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2021-12-22 16:22:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 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-22 16:22:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-12-22 16:22:33,050 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 8 [2021-12-22 16:22:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,051 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-12-22 16:22:33,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-22 16:22:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-12-22 16:22:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:22:33,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:22:33,052 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash 292159279, now seen corresponding path program 1 times [2021-12-22 16:22:33,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119241715] [2021-12-22 16:22:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,112 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-22 16:22:33,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119241715] [2021-12-22 16:22:33,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119241715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:33,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385814118] [2021-12-22 16:22:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:33,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:33,117 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-22 16:22:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,208 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-12-22 16:22:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:22:33,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-22 16:22:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,209 INFO L225 Difference]: With dead ends: 95 [2021-12-22 16:22:33,210 INFO L226 Difference]: Without dead ends: 95 [2021-12-22 16:22:33,210 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-22 16:22:33,211 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 9 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 228 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-22 16:22:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-22 16:22:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 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-22 16:22:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-12-22 16:22:33,222 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 11 [2021-12-22 16:22:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,223 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-12-22 16:22:33,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-22 16:22:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-12-22 16:22:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:22:33,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:22:33,226 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:33,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 292159280, now seen corresponding path program 1 times [2021-12-22 16:22:33,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314266340] [2021-12-22 16:22:33,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,333 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-22 16:22:33,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314266340] [2021-12-22 16:22:33,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314266340] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:33,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777067900] [2021-12-22 16:22:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:33,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:33,336 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-22 16:22:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,437 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-22 16:22:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-22 16:22:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,438 INFO L225 Difference]: With dead ends: 94 [2021-12-22 16:22:33,438 INFO L226 Difference]: Without dead ends: 94 [2021-12-22 16:22:33,438 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-22 16:22:33,439 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 223 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-22 16:22:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-22 16:22:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 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-22 16:22:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-12-22 16:22:33,443 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 11 [2021-12-22 16:22:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,443 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-12-22 16:22:33,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-22 16:22:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-12-22 16:22:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:22:33,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:22:33,444 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash 467005134, now seen corresponding path program 1 times [2021-12-22 16:22:33,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26569170] [2021-12-22 16:22:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,539 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-22 16:22:33,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26569170] [2021-12-22 16:22:33,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26569170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:33,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348574577] [2021-12-22 16:22:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:33,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:33,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:33,550 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-22 16:22:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,724 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2021-12-22 16:22:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:22:33,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-22 16:22:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,725 INFO L225 Difference]: With dead ends: 177 [2021-12-22 16:22:33,725 INFO L226 Difference]: Without dead ends: 177 [2021-12-22 16:22:33,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:22:33,726 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 279 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 380 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-22 16:22:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2021-12-22 16:22:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 16:22:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2021-12-22 16:22:33,729 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 12 [2021-12-22 16:22:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,729 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2021-12-22 16:22:33,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-22 16:22:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2021-12-22 16:22:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:22:33,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:22:33,735 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:33,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1592261436, now seen corresponding path program 1 times [2021-12-22 16:22:33,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944680497] [2021-12-22 16:22:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,842 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-22 16:22:33,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944680497] [2021-12-22 16:22:33,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944680497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:33,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638372095] [2021-12-22 16:22:33,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:33,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:33,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:33,844 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-22 16:22:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,085 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2021-12-22 16:22:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:22:34,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-22 16:22:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,086 INFO L225 Difference]: With dead ends: 139 [2021-12-22 16:22:34,086 INFO L226 Difference]: Without dead ends: 139 [2021-12-22 16:22:34,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:22:34,087 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 314 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 210 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-22 16:22:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2021-12-22 16:22:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 98 states have internal predecessors, (107), 0 states have call successors, (0), 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-22 16:22:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-12-22 16:22:34,090 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 13 [2021-12-22 16:22:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,090 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-12-22 16:22:34,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-22 16:22:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-12-22 16:22:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:22:34,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:22:34,090 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1592261437, now seen corresponding path program 1 times [2021-12-22 16:22:34,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011019227] [2021-12-22 16:22:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,234 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-22 16:22:34,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011019227] [2021-12-22 16:22:34,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011019227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:34,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002799309] [2021-12-22 16:22:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:34,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:34,236 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-22 16:22:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,440 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2021-12-22 16:22:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:22:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-22 16:22:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,441 INFO L225 Difference]: With dead ends: 171 [2021-12-22 16:22:34,441 INFO L226 Difference]: Without dead ends: 171 [2021-12-22 16:22:34,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:34,442 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 324 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 216 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-22 16:22:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 111. [2021-12-22 16:22:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.5060240963855422) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 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-22 16:22:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2021-12-22 16:22:34,444 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 13 [2021-12-22 16:22:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,445 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2021-12-22 16:22:34,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-22 16:22:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2021-12-22 16:22:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:22:34,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:22:34,445 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1089000433, now seen corresponding path program 1 times [2021-12-22 16:22:34,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725599329] [2021-12-22 16:22:34,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,526 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-22 16:22:34,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725599329] [2021-12-22 16:22:34,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725599329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:34,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849555505] [2021-12-22 16:22:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:34,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:34,529 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-22 16:22:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,781 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2021-12-22 16:22:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 16:22:34,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-12-22 16:22:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,782 INFO L225 Difference]: With dead ends: 119 [2021-12-22 16:22:34,782 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 16:22:34,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:22:34,783 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 171 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 172 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 16:22:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2021-12-22 16:22:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 109 states have internal predecessors, (124), 0 states have call successors, (0), 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-22 16:22:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2021-12-22 16:22:34,786 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 15 [2021-12-22 16:22:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,786 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2021-12-22 16:22:34,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-22 16:22:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2021-12-22 16:22:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:22:34,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:22:34,787 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1089000434, now seen corresponding path program 1 times [2021-12-22 16:22:34,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241882554] [2021-12-22 16:22:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,940 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-22 16:22:34,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241882554] [2021-12-22 16:22:34,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241882554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:22:34,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11116248] [2021-12-22 16:22:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 16:22:34,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 16:22:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:22:34,942 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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-22 16:22:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,293 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2021-12-22 16:22:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 16:22:35,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-12-22 16:22:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,294 INFO L225 Difference]: With dead ends: 114 [2021-12-22 16:22:35,295 INFO L226 Difference]: Without dead ends: 114 [2021-12-22 16:22:35,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-22 16:22:35,296 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 160 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 211 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-22 16:22:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2021-12-22 16:22:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 97 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-22 16:22:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2021-12-22 16:22:35,299 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 15 [2021-12-22 16:22:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,299 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2021-12-22 16:22:35,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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-22 16:22:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2021-12-22 16:22:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 16:22:35,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:35,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:22:35,300 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1441707388, now seen corresponding path program 1 times [2021-12-22 16:22:35,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544284435] [2021-12-22 16:22:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,404 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-22 16:22:35,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544284435] [2021-12-22 16:22:35,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544284435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:35,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877194542] [2021-12-22 16:22:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:35,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:35,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:35,406 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-22 16:22:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,665 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2021-12-22 16:22:35,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:22:35,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-22 16:22:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,666 INFO L225 Difference]: With dead ends: 146 [2021-12-22 16:22:35,667 INFO L226 Difference]: Without dead ends: 146 [2021-12-22 16:22:35,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:22:35,667 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 333 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 319 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-22 16:22:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2021-12-22 16:22:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 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-22 16:22:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-12-22 16:22:35,670 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 16 [2021-12-22 16:22:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,671 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-12-22 16:22:35,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-22 16:22:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-12-22 16:22:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 16:22:35,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:35,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 16:22:35,672 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1441707389, now seen corresponding path program 1 times [2021-12-22 16:22:35,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153619140] [2021-12-22 16:22:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,822 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-22 16:22:35,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153619140] [2021-12-22 16:22:35,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153619140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:35,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450179189] [2021-12-22 16:22:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:35,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:35,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:35,825 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-22 16:22:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,149 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2021-12-22 16:22:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 16:22:36,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-22 16:22:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,152 INFO L225 Difference]: With dead ends: 156 [2021-12-22 16:22:36,152 INFO L226 Difference]: Without dead ends: 156 [2021-12-22 16:22:36,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:22:36,153 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 180 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 254 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-22 16:22:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 98. [2021-12-22 16:22:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 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-22 16:22:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-12-22 16:22:36,156 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 16 [2021-12-22 16:22:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,156 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-12-22 16:22:36,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-22 16:22:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-12-22 16:22:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 16:22:36,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:36,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:22:36,160 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1743241268, now seen corresponding path program 1 times [2021-12-22 16:22:36,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019084423] [2021-12-22 16:22:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,250 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-22 16:22:36,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019084423] [2021-12-22 16:22:36,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019084423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:36,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407729661] [2021-12-22 16:22:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:36,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:36,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:36,252 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-22 16:22:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,469 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2021-12-22 16:22:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:22:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-12-22 16:22:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,470 INFO L225 Difference]: With dead ends: 137 [2021-12-22 16:22:36,470 INFO L226 Difference]: Without dead ends: 137 [2021-12-22 16:22:36,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:22:36,471 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 243 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 209 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-22 16:22:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2021-12-22 16:22:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.5) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 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-22 16:22:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2021-12-22 16:22:36,474 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2021-12-22 16:22:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,474 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2021-12-22 16:22:36,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-22 16:22:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2021-12-22 16:22:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 16:22:36,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:36,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:22:36,475 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1743241269, now seen corresponding path program 1 times [2021-12-22 16:22:36,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540544800] [2021-12-22 16:22:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,594 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-22 16:22:36,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540544800] [2021-12-22 16:22:36,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540544800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:36,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784246311] [2021-12-22 16:22:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:36,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:36,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:36,596 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-22 16:22:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,870 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2021-12-22 16:22:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:22:36,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-12-22 16:22:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,871 INFO L225 Difference]: With dead ends: 158 [2021-12-22 16:22:36,871 INFO L226 Difference]: Without dead ends: 158 [2021-12-22 16:22:36,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:36,874 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 185 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 243 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-22 16:22:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 120. [2021-12-22 16:22:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 119 states have internal predecessors, (146), 0 states have call successors, (0), 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-22 16:22:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2021-12-22 16:22:36,878 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 17 [2021-12-22 16:22:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,878 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2021-12-22 16:22:36,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-22 16:22:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2021-12-22 16:22:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:22:36,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,880 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] [2021-12-22 16:22:36,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:22:36,880 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1843781729, now seen corresponding path program 1 times [2021-12-22 16:22:36,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287739492] [2021-12-22 16:22:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,972 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-22 16:22:36,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287739492] [2021-12-22 16:22:36,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287739492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:36,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626439159] [2021-12-22 16:22:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:36,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:36,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:36,975 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-22 16:22:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,199 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2021-12-22 16:22:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 16:22:37,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-12-22 16:22:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,200 INFO L225 Difference]: With dead ends: 154 [2021-12-22 16:22:37,200 INFO L226 Difference]: Without dead ends: 154 [2021-12-22 16:22:37,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:37,201 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 135 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:37,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 335 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-22 16:22:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2021-12-22 16:22:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 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-22 16:22:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2021-12-22 16:22:37,203 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 20 [2021-12-22 16:22:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,203 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2021-12-22 16:22:37,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-22 16:22:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2021-12-22 16:22:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:22:37,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,221 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] [2021-12-22 16:22:37,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 16:22:37,221 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1400081941, now seen corresponding path program 1 times [2021-12-22 16:22:37,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546629964] [2021-12-22 16:22:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,410 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-22 16:22:37,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546629964] [2021-12-22 16:22:37,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546629964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 16:22:37,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009126237] [2021-12-22 16:22:37,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:22:37,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:22:37,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:37,411 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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-22 16:22:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,842 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2021-12-22 16:22:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 16:22:37,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-12-22 16:22:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,843 INFO L225 Difference]: With dead ends: 144 [2021-12-22 16:22:37,843 INFO L226 Difference]: Without dead ends: 144 [2021-12-22 16:22:37,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-12-22 16:22:37,844 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 221 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:37,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 562 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-22 16:22:37,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2021-12-22 16:22:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.46) internal successors, (146), 120 states have internal predecessors, (146), 0 states have call successors, (0), 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-22 16:22:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2021-12-22 16:22:37,848 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 20 [2021-12-22 16:22:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,848 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2021-12-22 16:22:37,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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-22 16:22:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2021-12-22 16:22:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:22:37,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,849 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] [2021-12-22 16:22:37,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 16:22:37,849 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1168177799, now seen corresponding path program 1 times [2021-12-22 16:22:37,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056755612] [2021-12-22 16:22:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,899 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-22 16:22:37,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056755612] [2021-12-22 16:22:37,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056755612] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:22:37,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527127103] [2021-12-22 16:22:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:22:37,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:22:37,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:22:37,901 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-22 16:22:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,988 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2021-12-22 16:22:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:22:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-12-22 16:22:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,989 INFO L225 Difference]: With dead ends: 120 [2021-12-22 16:22:37,989 INFO L226 Difference]: Without dead ends: 120 [2021-12-22 16:22:37,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:37,990 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 189 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:37,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 99 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-22 16:22:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-12-22 16:22:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 118 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-22 16:22:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2021-12-22 16:22:37,993 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 20 [2021-12-22 16:22:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,993 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2021-12-22 16:22:37,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-22 16:22:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2021-12-22 16:22:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:22:37,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,995 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-22 16:22:37,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 16:22:37,995 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash -453239385, now seen corresponding path program 1 times [2021-12-22 16:22:37,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923185910] [2021-12-22 16:22:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:38,035 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-22 16:22:38,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:38,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923185910] [2021-12-22 16:22:38,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923185910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:38,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:38,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:38,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649379995] [2021-12-22 16:22:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:38,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:38,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:38,038 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-22 16:22:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:38,147 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2021-12-22 16:22:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:22:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-22 16:22:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:38,148 INFO L225 Difference]: With dead ends: 120 [2021-12-22 16:22:38,149 INFO L226 Difference]: Without dead ends: 120 [2021-12-22 16:22:38,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:22:38,149 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:38,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 162 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-22 16:22:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2021-12-22 16:22:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 states have internal predecessors, (141), 0 states have call successors, (0), 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-22 16:22:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2021-12-22 16:22:38,152 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 21 [2021-12-22 16:22:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:38,152 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2021-12-22 16:22:38,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-22 16:22:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2021-12-22 16:22:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:22:38,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:38,152 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-22 16:22:38,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 16:22:38,152 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:38,153 INFO L85 PathProgramCache]: Analyzing trace with hash -453239384, now seen corresponding path program 1 times [2021-12-22 16:22:38,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:38,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177886746] [2021-12-22 16:22:38,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:38,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:38,342 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-22 16:22:38,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:38,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177886746] [2021-12-22 16:22:38,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177886746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:38,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:38,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:38,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409966256] [2021-12-22 16:22:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:38,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:38,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:38,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:38,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:38,344 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-22 16:22:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:38,614 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2021-12-22 16:22:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:22:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-22 16:22:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:38,615 INFO L225 Difference]: With dead ends: 149 [2021-12-22 16:22:38,615 INFO L226 Difference]: Without dead ends: 149 [2021-12-22 16:22:38,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-12-22 16:22:38,615 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 188 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:38,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 288 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-22 16:22:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 118. [2021-12-22 16:22:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 117 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2021-12-22 16:22:38,617 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 21 [2021-12-22 16:22:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:38,617 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2021-12-22 16:22:38,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-22 16:22:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2021-12-22 16:22:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 16:22:38,618 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:38,618 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-22 16:22:38,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 16:22:38,618 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:38,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1947258978, now seen corresponding path program 1 times [2021-12-22 16:22:38,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:38,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964447175] [2021-12-22 16:22:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:38,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:38,782 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-22 16:22:38,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:38,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964447175] [2021-12-22 16:22:38,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964447175] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:38,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:38,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:22:38,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592495768] [2021-12-22 16:22:38,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:38,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:38,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:38,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:38,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:38,784 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-22 16:22:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:38,989 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2021-12-22 16:22:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:22:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-22 16:22:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:38,990 INFO L225 Difference]: With dead ends: 136 [2021-12-22 16:22:38,990 INFO L226 Difference]: Without dead ends: 136 [2021-12-22 16:22:38,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-22 16:22:38,991 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 220 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:38,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 396 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-22 16:22:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2021-12-22 16:22:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.404040404040404) internal successors, (139), 117 states have internal predecessors, (139), 0 states have call successors, (0), 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-22 16:22:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2021-12-22 16:22:38,993 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 22 [2021-12-22 16:22:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:38,994 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2021-12-22 16:22:38,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-22 16:22:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2021-12-22 16:22:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 16:22:38,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:38,994 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] [2021-12-22 16:22:38,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 16:22:38,994 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-22 16:22:38,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:38,994 INFO L85 PathProgramCache]: Analyzing trace with hash 922767525, now seen corresponding path program 1 times [2021-12-22 16:22:38,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:38,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935531380] [2021-12-22 16:22:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:38,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:22:39,010 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 16:22:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:22:39,038 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 16:22:39,039 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 16:22:39,040 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2021-12-22 16:22:39,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (48 of 50 remaining) [2021-12-22 16:22:39,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (47 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (46 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (45 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (44 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (43 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (42 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (41 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (40 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (39 of 50 remaining) [2021-12-22 16:22:39,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (38 of 50 remaining) [2021-12-22 16:22:39,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (37 of 50 remaining) [2021-12-22 16:22:39,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (36 of 50 remaining) [2021-12-22 16:22:39,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (35 of 50 remaining) [2021-12-22 16:22:39,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (34 of 50 remaining) [2021-12-22 16:22:39,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (33 of 50 remaining) [2021-12-22 16:22:39,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (32 of 50 remaining) [2021-12-22 16:22:39,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (31 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (30 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (29 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (28 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (27 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (26 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (25 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (24 of 50 remaining) [2021-12-22 16:22:39,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (23 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (22 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (21 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (20 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (19 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (18 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (17 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (16 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (15 of 50 remaining) [2021-12-22 16:22:39,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (14 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (13 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (12 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (11 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (10 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (9 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (8 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (7 of 50 remaining) [2021-12-22 16:22:39,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (6 of 50 remaining) [2021-12-22 16:22:39,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (5 of 50 remaining) [2021-12-22 16:22:39,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (4 of 50 remaining) [2021-12-22 16:22:39,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (3 of 50 remaining) [2021-12-22 16:22:39,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (2 of 50 remaining) [2021-12-22 16:22:39,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (1 of 50 remaining) [2021-12-22 16:22:39,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2021-12-22 16:22:39,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-22 16:22:39,054 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:39,057 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 16:22:39,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:22:39 BoogieIcfgContainer [2021-12-22 16:22:39,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 16:22:39,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 16:22:39,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 16:22:39,100 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 16:22:39,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32" (3/4) ... [2021-12-22 16:22:39,102 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 16:22:39,132 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 16:22:39,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 16:22:39,133 INFO L158 Benchmark]: Toolchain (without parser) took 7964.98ms. Allocated memory was 94.4MB in the beginning and 232.8MB in the end (delta: 138.4MB). Free memory was 65.6MB in the beginning and 159.8MB in the end (delta: -94.2MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2021-12-22 16:22:39,133 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:22:39,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.29ms. Allocated memory was 94.4MB in the beginning and 186.6MB in the end (delta: 92.3MB). Free memory was 65.3MB in the beginning and 156.8MB in the end (delta: -91.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2021-12-22 16:22:39,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.77ms. Allocated memory is still 186.6MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:39,136 INFO L158 Benchmark]: Boogie Preprocessor took 37.47ms. Allocated memory is still 186.6MB. Free memory was 154.7MB in the beginning and 153.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:39,137 INFO L158 Benchmark]: RCFGBuilder took 375.64ms. Allocated memory is still 186.6MB. Free memory was 153.3MB in the beginning and 135.1MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-22 16:22:39,137 INFO L158 Benchmark]: TraceAbstraction took 6954.26ms. Allocated memory was 186.6MB in the beginning and 232.8MB in the end (delta: 46.1MB). Free memory was 134.4MB in the beginning and 161.9MB in the end (delta: -27.4MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2021-12-22 16:22:39,137 INFO L158 Benchmark]: Witness Printer took 32.72ms. Allocated memory is still 232.8MB. Free memory was 161.9MB in the beginning and 159.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:39,143 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.29ms. Allocated memory was 94.4MB in the beginning and 186.6MB in the end (delta: 92.3MB). Free memory was 65.3MB in the beginning and 156.8MB in the end (delta: -91.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.77ms. Allocated memory is still 186.6MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.47ms. Allocated memory is still 186.6MB. Free memory was 154.7MB in the beginning and 153.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.64ms. Allocated memory is still 186.6MB. Free memory was 153.3MB in the beginning and 135.1MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6954.26ms. Allocated memory was 186.6MB in the beginning and 232.8MB in the end (delta: 46.1MB). Free memory was 134.4MB in the beginning and 161.9MB in the end (delta: -27.4MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Witness Printer took 32.72ms. Allocated memory is still 232.8MB. Free memory was 161.9MB in the beginning and 159.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1034]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head VAL [head={-1:0}] [L999] head->data = 0 VAL [head={-1:0}] [L1001] SLL* x = head; [L1002] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1027] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1029] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, state=1, x={-1:0}] [L1029] x = head->next [L1030] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1032] COND TRUE x->data != 0 [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1034] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1034] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1034] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3622 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3622 mSDsluCounter, 4822 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3558 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4180 IncrementalHoareTripleChecker+Invalid, 4494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 1264 mSDtfsCounter, 4180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=16, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 526 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 3132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-22 16:22:39,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)