./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-18 19:19:11,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 19:19:11,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 19:19:11,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 19:19:11,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 19:19:11,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 19:19:11,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 19:19:11,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 19:19:11,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 19:19:11,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 19:19:11,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 19:19:11,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 19:19:11,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 19:19:11,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 19:19:11,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 19:19:11,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 19:19:11,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 19:19:11,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 19:19:11,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 19:19:11,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 19:19:11,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 19:19:11,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 19:19:11,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 19:19:11,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 19:19:11,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 19:19:11,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 19:19:11,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 19:19:11,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 19:19:11,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 19:19:11,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 19:19:11,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 19:19:11,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 19:19:11,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 19:19:11,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 19:19:11,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 19:19:11,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 19:19:11,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 19:19:11,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 19:19:11,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 19:19:11,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 19:19:11,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 19:19:11,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-18 19:19:11,117 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 19:19:11,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 19:19:11,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 19:19:11,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 19:19:11,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 19:19:11,118 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 19:19:11,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 19:19:11,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 19:19:11,119 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 19:19:11,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 19:19:11,119 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 19:19:11,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 19:19:11,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 19:19:11,122 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-18 19:19:11,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 19:19:11,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 19:19:11,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 19:19:11,317 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 19:19:11,322 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 19:19:11,324 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-18 19:19:11,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551c865ac/84f3532828fa4f95867d75842aa8742a/FLAG2510e8e65 [2021-12-18 19:19:11,818 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 19:19:11,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2021-12-18 19:19:11,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551c865ac/84f3532828fa4f95867d75842aa8742a/FLAG2510e8e65 [2021-12-18 19:19:11,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551c865ac/84f3532828fa4f95867d75842aa8742a [2021-12-18 19:19:11,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 19:19:11,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 19:19:11,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 19:19:11,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 19:19:11,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 19:19:11,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:11,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779b3c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11, skipping insertion in model container [2021-12-18 19:19:11,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:11,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 19:19:11,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 19:19:12,122 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-18 19:19:12,127 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-18 19:19:12,130 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-18 19:19:12,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 19:19:12,144 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 19:19:12,172 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-18 19:19:12,180 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-18 19:19:12,184 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-18 19:19:12,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 19:19:12,207 INFO L208 MainTranslator]: Completed translation [2021-12-18 19:19:12,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12 WrapperNode [2021-12-18 19:19:12,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 19:19:12,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 19:19:12,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 19:19:12,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 19:19:12,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,252 INFO L137 Inliner]: procedures = 119, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2021-12-18 19:19:12,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 19:19:12,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 19:19:12,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 19:19:12,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 19:19:12,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 19:19:12,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 19:19:12,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 19:19:12,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 19:19:12,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 19:19:12,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 19:19:12,316 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-18 19:19:12,321 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-18 19:19:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 19:19:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 19:19:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 19:19:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 19:19:12,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 19:19:12,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 19:19:12,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 19:19:12,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 19:19:12,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 19:19:12,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 19:19:12,422 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 19:19:12,423 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 19:19:12,634 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 19:19:12,639 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 19:19:12,639 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-18 19:19:12,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12 BoogieIcfgContainer [2021-12-18 19:19:12,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 19:19:12,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 19:19:12,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 19:19:12,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 19:19:12,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:19:11" (1/3) ... [2021-12-18 19:19:12,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0ff5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:19:12, skipping insertion in model container [2021-12-18 19:19:12,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (2/3) ... [2021-12-18 19:19:12,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0ff5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:19:12, skipping insertion in model container [2021-12-18 19:19:12,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12" (3/3) ... [2021-12-18 19:19:12,648 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2021-12-18 19:19:12,652 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 19:19:12,652 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2021-12-18 19:19:12,679 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 19:19:12,685 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-18 19:19:12,685 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2021-12-18 19:19:12,697 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-18 19:19:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 19:19:12,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:12,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 19:19:12,701 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-18 19:19:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 19:19:12,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:12,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859047067] [2021-12-18 19:19:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:12,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:12,832 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-18 19:19:12,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:12,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859047067] [2021-12-18 19:19:12,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859047067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:12,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:12,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:12,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025140201] [2021-12-18 19:19:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:12,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:12,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:12,863 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-18 19:19:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:12,957 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2021-12-18 19:19:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:12,960 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-18 19:19:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:12,966 INFO L225 Difference]: With dead ends: 115 [2021-12-18 19:19:12,966 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 19:19:12,967 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-18 19:19:12,970 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-18 19:19:12,971 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-18 19:19:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 19:19:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2021-12-18 19:19:12,997 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-18 19:19:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2021-12-18 19:19:12,999 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 3 [2021-12-18 19:19:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,000 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2021-12-18 19:19:13,000 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-18 19:19:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2021-12-18 19:19:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 19:19:13,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 19:19:13,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 19:19:13,001 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-18 19:19:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 19:19:13,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50453755] [2021-12-18 19:19:13,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,042 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-18 19:19:13,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50453755] [2021-12-18 19:19:13,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50453755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:13,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796708369] [2021-12-18 19:19:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:13,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,051 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-18 19:19:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,125 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-18 19:19:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:13,126 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-18 19:19:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,127 INFO L225 Difference]: With dead ends: 111 [2021-12-18 19:19:13,127 INFO L226 Difference]: Without dead ends: 111 [2021-12-18 19:19:13,127 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-18 19:19:13,128 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-18 19:19:13,129 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-18 19:19:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-18 19:19:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2021-12-18 19:19:13,135 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-18 19:19:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2021-12-18 19:19:13,137 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 3 [2021-12-18 19:19:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,138 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2021-12-18 19:19:13,139 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-18 19:19:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2021-12-18 19:19:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 19:19:13,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 19:19:13,141 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-18 19:19:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 59263659, now seen corresponding path program 1 times [2021-12-18 19:19:13,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069083092] [2021-12-18 19:19:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,186 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-18 19:19:13,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069083092] [2021-12-18 19:19:13,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069083092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 19:19:13,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578937079] [2021-12-18 19:19:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 19:19:13,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 19:19:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 19:19:13,189 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-18 19:19:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,262 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2021-12-18 19:19:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 19:19:13,263 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-18 19:19:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,263 INFO L225 Difference]: With dead ends: 96 [2021-12-18 19:19:13,264 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 19:19:13,264 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-18 19:19:13,265 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-18 19:19:13,265 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-18 19:19:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 19:19:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2021-12-18 19:19:13,269 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-18 19:19:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2021-12-18 19:19:13,269 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 8 [2021-12-18 19:19:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,270 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2021-12-18 19:19:13,270 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-18 19:19:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2021-12-18 19:19:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 19:19:13,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 19:19:13,271 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-18 19:19:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 59263660, now seen corresponding path program 1 times [2021-12-18 19:19:13,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366475098] [2021-12-18 19:19:13,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,343 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-18 19:19:13,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366475098] [2021-12-18 19:19:13,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366475098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 19:19:13,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724238892] [2021-12-18 19:19:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 19:19:13,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 19:19:13,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 19:19:13,347 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-18 19:19:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,457 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-12-18 19:19:13,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 19:19:13,458 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-18 19:19:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,459 INFO L225 Difference]: With dead ends: 112 [2021-12-18 19:19:13,459 INFO L226 Difference]: Without dead ends: 112 [2021-12-18 19:19:13,459 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-18 19:19:13,460 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-18 19:19:13,460 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-18 19:19:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-18 19:19:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2021-12-18 19:19:13,464 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-18 19:19:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-12-18 19:19:13,465 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 8 [2021-12-18 19:19:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,465 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-12-18 19:19:13,465 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-18 19:19:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-12-18 19:19:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 19:19:13,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 19:19:13,466 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-18 19:19:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 292159279, now seen corresponding path program 1 times [2021-12-18 19:19:13,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774088861] [2021-12-18 19:19:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,505 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-18 19:19:13,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774088861] [2021-12-18 19:19:13,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774088861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:13,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832158280] [2021-12-18 19:19:13,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:13,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:13,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:13,507 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-18 19:19:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,594 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-12-18 19:19:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 19:19:13,595 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-18 19:19:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,596 INFO L225 Difference]: With dead ends: 95 [2021-12-18 19:19:13,596 INFO L226 Difference]: Without dead ends: 95 [2021-12-18 19:19:13,597 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-18 19:19:13,599 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-18 19:19:13,600 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-18 19:19:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-18 19:19:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-18 19:19:13,614 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-18 19:19:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-12-18 19:19:13,615 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 11 [2021-12-18 19:19:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,615 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-12-18 19:19:13,616 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-18 19:19:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-12-18 19:19:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 19:19:13,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 19:19:13,617 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-18 19:19:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash 292159280, now seen corresponding path program 1 times [2021-12-18 19:19:13,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97765584] [2021-12-18 19:19:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,687 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-18 19:19:13,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97765584] [2021-12-18 19:19:13,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97765584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:13,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414689924] [2021-12-18 19:19:13,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:13,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:13,690 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-18 19:19:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,813 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-18 19:19:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 19:19:13,813 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-18 19:19:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,814 INFO L225 Difference]: With dead ends: 94 [2021-12-18 19:19:13,814 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 19:19:13,814 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-18 19:19:13,815 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-18 19:19:13,815 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-18 19:19:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 19:19:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-18 19:19:13,818 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-18 19:19:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-12-18 19:19:13,818 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 11 [2021-12-18 19:19:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,818 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-12-18 19:19:13,818 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-18 19:19:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-12-18 19:19:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 19:19:13,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 19:19:13,819 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-18 19:19:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash 467005134, now seen corresponding path program 1 times [2021-12-18 19:19:13,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090954360] [2021-12-18 19:19:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,037 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-18 19:19:14,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090954360] [2021-12-18 19:19:14,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090954360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:14,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:14,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 19:19:14,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376226402] [2021-12-18 19:19:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:14,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:14,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:14,040 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-18 19:19:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:14,271 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2021-12-18 19:19:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 19:19:14,272 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-18 19:19:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:14,272 INFO L225 Difference]: With dead ends: 177 [2021-12-18 19:19:14,273 INFO L226 Difference]: Without dead ends: 177 [2021-12-18 19:19:14,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-12-18 19:19:14,275 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 277 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:14,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 367 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-18 19:19:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2021-12-18 19:19:14,286 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-18 19:19:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2021-12-18 19:19:14,287 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 12 [2021-12-18 19:19:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:14,290 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2021-12-18 19:19:14,290 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-18 19:19:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2021-12-18 19:19:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 19:19:14,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:14,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:14,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 19:19:14,291 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-18 19:19:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1592261436, now seen corresponding path program 1 times [2021-12-18 19:19:14,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:14,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481790171] [2021-12-18 19:19:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,437 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-18 19:19:14,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481790171] [2021-12-18 19:19:14,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481790171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:14,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:14,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:14,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623333150] [2021-12-18 19:19:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:14,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:14,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:14,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:14,439 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-18 19:19:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:14,672 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2021-12-18 19:19:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 19:19:14,672 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-18 19:19:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:14,673 INFO L225 Difference]: With dead ends: 139 [2021-12-18 19:19:14,673 INFO L226 Difference]: Without dead ends: 139 [2021-12-18 19:19:14,675 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-18 19:19:14,675 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 267 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:14,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 212 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-18 19:19:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2021-12-18 19:19:14,683 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-18 19:19:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-12-18 19:19:14,684 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 13 [2021-12-18 19:19:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:14,685 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-12-18 19:19:14,687 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-18 19:19:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-12-18 19:19:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 19:19:14,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:14,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:14,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 19:19:14,688 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-18 19:19:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1592261437, now seen corresponding path program 1 times [2021-12-18 19:19:14,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:14,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510779544] [2021-12-18 19:19:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,824 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-18 19:19:14,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510779544] [2021-12-18 19:19:14,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510779544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:14,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:14,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:14,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131554655] [2021-12-18 19:19:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:14,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:14,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:14,826 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-18 19:19:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:15,088 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2021-12-18 19:19:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 19:19:15,089 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-18 19:19:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:15,090 INFO L225 Difference]: With dead ends: 171 [2021-12-18 19:19:15,090 INFO L226 Difference]: Without dead ends: 171 [2021-12-18 19:19:15,090 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-18 19:19:15,090 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 184 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:15,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 284 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-18 19:19:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 111. [2021-12-18 19:19:15,093 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-18 19:19:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2021-12-18 19:19:15,093 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 13 [2021-12-18 19:19:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:15,094 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2021-12-18 19:19:15,094 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-18 19:19:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2021-12-18 19:19:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 19:19:15,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:15,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:15,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 19:19:15,095 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-18 19:19:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1089000433, now seen corresponding path program 1 times [2021-12-18 19:19:15,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:15,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389420341] [2021-12-18 19:19:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:15,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:15,163 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-18 19:19:15,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:15,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389420341] [2021-12-18 19:19:15,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389420341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:15,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:15,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 19:19:15,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261900502] [2021-12-18 19:19:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:15,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 19:19:15,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 19:19:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 19:19:15,166 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-18 19:19:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:15,374 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2021-12-18 19:19:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 19:19:15,374 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-18 19:19:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:15,375 INFO L225 Difference]: With dead ends: 119 [2021-12-18 19:19:15,375 INFO L226 Difference]: Without dead ends: 119 [2021-12-18 19:19:15,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-18 19:19:15,376 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:15,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 191 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-18 19:19:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2021-12-18 19:19:15,378 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-18 19:19:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2021-12-18 19:19:15,378 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 15 [2021-12-18 19:19:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:15,378 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2021-12-18 19:19:15,379 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-18 19:19:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2021-12-18 19:19:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 19:19:15,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:15,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:15,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 19:19:15,379 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-18 19:19:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1089000434, now seen corresponding path program 1 times [2021-12-18 19:19:15,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082510176] [2021-12-18 19:19:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:15,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:15,463 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-18 19:19:15,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:15,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082510176] [2021-12-18 19:19:15,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082510176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:15,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:15,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 19:19:15,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713295179] [2021-12-18 19:19:15,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:15,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 19:19:15,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 19:19:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 19:19:15,465 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-18 19:19:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:15,802 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2021-12-18 19:19:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 19:19:15,802 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-18 19:19:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:15,803 INFO L225 Difference]: With dead ends: 114 [2021-12-18 19:19:15,803 INFO L226 Difference]: Without dead ends: 114 [2021-12-18 19:19:15,803 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-18 19:19:15,803 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:15,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 240 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-18 19:19:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2021-12-18 19:19:15,805 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-18 19:19:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2021-12-18 19:19:15,805 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 15 [2021-12-18 19:19:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:15,805 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2021-12-18 19:19:15,805 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-18 19:19:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2021-12-18 19:19:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 19:19:15,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:15,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:15,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 19:19:15,806 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-18 19:19:15,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1441707388, now seen corresponding path program 1 times [2021-12-18 19:19:15,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:15,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572460366] [2021-12-18 19:19:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:15,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:15,882 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-18 19:19:15,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:15,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572460366] [2021-12-18 19:19:15,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572460366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:15,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:15,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 19:19:15,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459987239] [2021-12-18 19:19:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:15,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 19:19:15,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 19:19:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-18 19:19:15,884 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-18 19:19:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,112 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2021-12-18 19:19:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 19:19:16,113 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-18 19:19:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,113 INFO L225 Difference]: With dead ends: 146 [2021-12-18 19:19:16,113 INFO L226 Difference]: Without dead ends: 146 [2021-12-18 19:19:16,113 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-18 19:19:16,114 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 265 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 322 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-18 19:19:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2021-12-18 19:19:16,115 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-18 19:19:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-12-18 19:19:16,116 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 16 [2021-12-18 19:19:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,116 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-12-18 19:19:16,116 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-18 19:19:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-12-18 19:19:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 19:19:16,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:16,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 19:19:16,116 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-18 19:19:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1441707389, now seen corresponding path program 1 times [2021-12-18 19:19:16,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633426665] [2021-12-18 19:19:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:16,228 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-18 19:19:16,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:16,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633426665] [2021-12-18 19:19:16,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633426665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:16,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:16,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:16,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112072499] [2021-12-18 19:19:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:16,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:16,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:16,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:16,230 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-18 19:19:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,421 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2021-12-18 19:19:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 19:19:16,421 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-18 19:19:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,422 INFO L225 Difference]: With dead ends: 156 [2021-12-18 19:19:16,422 INFO L226 Difference]: Without dead ends: 156 [2021-12-18 19:19:16,422 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-18 19:19:16,423 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 181 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 240 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-18 19:19:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 98. [2021-12-18 19:19:16,424 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-18 19:19:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-12-18 19:19:16,424 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 16 [2021-12-18 19:19:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,425 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-12-18 19:19:16,425 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-18 19:19:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-12-18 19:19:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 19:19:16,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:16,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 19:19:16,425 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-18 19:19:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1743241268, now seen corresponding path program 1 times [2021-12-18 19:19:16,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005598158] [2021-12-18 19:19:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:16,493 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-18 19:19:16,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:16,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005598158] [2021-12-18 19:19:16,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005598158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:16,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:16,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:16,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589381355] [2021-12-18 19:19:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:16,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:16,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:16,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:16,495 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-18 19:19:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,663 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2021-12-18 19:19:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 19:19:16,663 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-18 19:19:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,664 INFO L225 Difference]: With dead ends: 137 [2021-12-18 19:19:16,664 INFO L226 Difference]: Without dead ends: 137 [2021-12-18 19:19:16,664 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-18 19:19:16,664 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.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,665 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.1s Time] [2021-12-18 19:19:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-18 19:19:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2021-12-18 19:19:16,667 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-18 19:19:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2021-12-18 19:19:16,668 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2021-12-18 19:19:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,668 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2021-12-18 19:19:16,668 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-18 19:19:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2021-12-18 19:19:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 19:19:16,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:16,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 19:19:16,669 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-18 19:19:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1743241269, now seen corresponding path program 1 times [2021-12-18 19:19:16,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769506861] [2021-12-18 19:19:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:16,779 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-18 19:19:16,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:16,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769506861] [2021-12-18 19:19:16,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769506861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:16,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:16,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:16,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382807445] [2021-12-18 19:19:16,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:16,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:16,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:16,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:16,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:16,781 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-18 19:19:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,964 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2021-12-18 19:19:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 19:19:16,965 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-18 19:19:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,965 INFO L225 Difference]: With dead ends: 158 [2021-12-18 19:19:16,966 INFO L226 Difference]: Without dead ends: 158 [2021-12-18 19:19:16,966 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-18 19:19:16,966 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 222 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 198 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-18 19:19:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 120. [2021-12-18 19:19:16,968 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-18 19:19:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2021-12-18 19:19:16,968 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 17 [2021-12-18 19:19:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,969 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2021-12-18 19:19:16,969 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-18 19:19:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2021-12-18 19:19:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 19:19:16,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,969 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-18 19:19:16,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 19:19:16,969 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-18 19:19:16,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1843781729, now seen corresponding path program 1 times [2021-12-18 19:19:16,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183401210] [2021-12-18 19:19:16,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:17,043 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-18 19:19:17,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:17,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183401210] [2021-12-18 19:19:17,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183401210] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:17,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:17,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:17,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733325632] [2021-12-18 19:19:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:17,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:17,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:17,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:17,045 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-18 19:19:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:17,205 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2021-12-18 19:19:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 19:19:17,206 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-18 19:19:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:17,206 INFO L225 Difference]: With dead ends: 154 [2021-12-18 19:19:17,206 INFO L226 Difference]: Without dead ends: 154 [2021-12-18 19:19:17,207 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-18 19:19:17,207 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 217 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:17,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 241 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-18 19:19:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2021-12-18 19:19:17,209 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-18 19:19:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2021-12-18 19:19:17,209 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 20 [2021-12-18 19:19:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:17,209 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2021-12-18 19:19:17,209 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-18 19:19:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2021-12-18 19:19:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 19:19:17,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:17,210 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-18 19:19:17,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 19:19:17,210 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-18 19:19:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:17,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1400081941, now seen corresponding path program 1 times [2021-12-18 19:19:17,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:17,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760449309] [2021-12-18 19:19:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:17,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:17,421 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-18 19:19:17,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:17,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760449309] [2021-12-18 19:19:17,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760449309] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:17,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:17,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 19:19:17,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698379315] [2021-12-18 19:19:17,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:17,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 19:19:17,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 19:19:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-18 19:19:17,423 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-18 19:19:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:17,789 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2021-12-18 19:19:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 19:19:17,789 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-18 19:19:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:17,790 INFO L225 Difference]: With dead ends: 144 [2021-12-18 19:19:17,790 INFO L226 Difference]: Without dead ends: 144 [2021-12-18 19:19:17,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-12-18 19:19:17,791 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 232 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:17,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 536 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-18 19:19:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2021-12-18 19:19:17,811 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-18 19:19:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2021-12-18 19:19:17,812 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 20 [2021-12-18 19:19:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:17,812 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2021-12-18 19:19:17,812 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-18 19:19:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2021-12-18 19:19:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 19:19:17,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:17,813 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-18 19:19:17,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 19:19:17,813 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-18 19:19:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1168177799, now seen corresponding path program 1 times [2021-12-18 19:19:17,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:17,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132483034] [2021-12-18 19:19:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:17,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:17,893 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-18 19:19:17,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:17,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132483034] [2021-12-18 19:19:17,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132483034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:17,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:17,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 19:19:17,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870042084] [2021-12-18 19:19:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:17,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 19:19:17,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 19:19:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-18 19:19:17,895 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-18 19:19:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:18,123 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2021-12-18 19:19:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 19:19:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-18 19:19:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:18,125 INFO L225 Difference]: With dead ends: 157 [2021-12-18 19:19:18,125 INFO L226 Difference]: Without dead ends: 157 [2021-12-18 19:19:18,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-12-18 19:19:18,126 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:18,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 319 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-18 19:19:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2021-12-18 19:19:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 134 states have internal predecessors, (163), 0 states have call successors, (0), 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-18 19:19:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2021-12-18 19:19:18,128 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 20 [2021-12-18 19:19:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:18,129 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2021-12-18 19:19:18,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-18 19:19:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2021-12-18 19:19:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 19:19:18,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:18,132 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-18 19:19:18,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 19:19:18,132 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-18 19:19:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -453239385, now seen corresponding path program 1 times [2021-12-18 19:19:18,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:18,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586451124] [2021-12-18 19:19:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:18,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:18,167 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-18 19:19:18,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:18,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586451124] [2021-12-18 19:19:18,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586451124] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:18,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:18,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:18,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215565538] [2021-12-18 19:19:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:18,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:18,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:18,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:18,170 INFO L87 Difference]: Start difference. First operand 135 states and 163 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-18 19:19:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:18,241 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2021-12-18 19:19:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 19:19:18,241 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-18 19:19:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:18,243 INFO L225 Difference]: With dead ends: 136 [2021-12-18 19:19:18,243 INFO L226 Difference]: Without dead ends: 136 [2021-12-18 19:19:18,244 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-18 19:19:18,244 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:18,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 168 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-18 19:19:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2021-12-18 19:19:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 133 states have internal predecessors, (160), 0 states have call successors, (0), 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-18 19:19:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2021-12-18 19:19:18,247 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 21 [2021-12-18 19:19:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:18,247 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2021-12-18 19:19:18,248 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-18 19:19:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2021-12-18 19:19:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 19:19:18,249 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:18,250 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-18 19:19:18,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 19:19:18,250 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-18 19:19:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:18,250 INFO L85 PathProgramCache]: Analyzing trace with hash -453239384, now seen corresponding path program 1 times [2021-12-18 19:19:18,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:18,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636369257] [2021-12-18 19:19:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:18,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:18,371 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-18 19:19:18,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:18,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636369257] [2021-12-18 19:19:18,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636369257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:18,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:18,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 19:19:18,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843741202] [2021-12-18 19:19:18,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:18,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 19:19:18,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:18,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 19:19:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-18 19:19:18,373 INFO L87 Difference]: Start difference. First operand 134 states and 160 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-18 19:19:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:18,640 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2021-12-18 19:19:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 19:19:18,640 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-18 19:19:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:18,641 INFO L225 Difference]: With dead ends: 164 [2021-12-18 19:19:18,641 INFO L226 Difference]: Without dead ends: 164 [2021-12-18 19:19:18,641 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-18 19:19:18,642 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 161 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:18,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 302 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-18 19:19:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. [2021-12-18 19:19:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.394736842105263) internal successors, (159), 133 states have internal predecessors, (159), 0 states have call successors, (0), 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-18 19:19:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2021-12-18 19:19:18,655 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 21 [2021-12-18 19:19:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:18,656 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2021-12-18 19:19:18,656 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-18 19:19:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2021-12-18 19:19:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 19:19:18,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:18,656 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-18 19:19:18,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 19:19:18,657 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-18 19:19:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1947258978, now seen corresponding path program 1 times [2021-12-18 19:19:18,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:18,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501584403] [2021-12-18 19:19:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:18,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:18,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-18 19:19:18,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501584403] [2021-12-18 19:19:18,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501584403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:18,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:18,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 19:19:18,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868597079] [2021-12-18 19:19:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:18,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 19:19:18,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 19:19:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-18 19:19:18,785 INFO L87 Difference]: Start difference. First operand 134 states and 159 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-18 19:19:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:19,035 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2021-12-18 19:19:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 19:19:19,035 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-18 19:19:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:19,042 INFO L225 Difference]: With dead ends: 151 [2021-12-18 19:19:19,042 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 19:19:19,043 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-18 19:19:19,043 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 220 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:19,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 424 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 19:19:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2021-12-18 19:19:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 133 states have internal predecessors, (158), 0 states have call successors, (0), 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-18 19:19:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2021-12-18 19:19:19,051 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 22 [2021-12-18 19:19:19,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:19,051 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2021-12-18 19:19:19,051 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-18 19:19:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2021-12-18 19:19:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 19:19:19,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:19,052 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-18 19:19:19,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 19:19:19,071 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-18 19:19:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash 922767525, now seen corresponding path program 1 times [2021-12-18 19:19:19,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986466615] [2021-12-18 19:19:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:19,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 19:19:19,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 19:19:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 19:19:19,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 19:19:19,135 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 19:19:19,136 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2021-12-18 19:19:19,137 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (48 of 50 remaining) [2021-12-18 19:19:19,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (47 of 50 remaining) [2021-12-18 19:19:19,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (46 of 50 remaining) [2021-12-18 19:19:19,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (45 of 50 remaining) [2021-12-18 19:19:19,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (44 of 50 remaining) [2021-12-18 19:19:19,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (43 of 50 remaining) [2021-12-18 19:19:19,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (42 of 50 remaining) [2021-12-18 19:19:19,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (41 of 50 remaining) [2021-12-18 19:19:19,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (40 of 50 remaining) [2021-12-18 19:19:19,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (39 of 50 remaining) [2021-12-18 19:19:19,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (38 of 50 remaining) [2021-12-18 19:19:19,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (37 of 50 remaining) [2021-12-18 19:19:19,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (36 of 50 remaining) [2021-12-18 19:19:19,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (35 of 50 remaining) [2021-12-18 19:19:19,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (34 of 50 remaining) [2021-12-18 19:19:19,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (33 of 50 remaining) [2021-12-18 19:19:19,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (32 of 50 remaining) [2021-12-18 19:19:19,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (31 of 50 remaining) [2021-12-18 19:19:19,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (30 of 50 remaining) [2021-12-18 19:19:19,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (29 of 50 remaining) [2021-12-18 19:19:19,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (28 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (27 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (26 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (25 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (24 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (23 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (22 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (21 of 50 remaining) [2021-12-18 19:19:19,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (20 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (19 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (18 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (17 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (16 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (15 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (14 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (13 of 50 remaining) [2021-12-18 19:19:19,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (12 of 50 remaining) [2021-12-18 19:19:19,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (11 of 50 remaining) [2021-12-18 19:19:19,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (10 of 50 remaining) [2021-12-18 19:19:19,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (9 of 50 remaining) [2021-12-18 19:19:19,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (8 of 50 remaining) [2021-12-18 19:19:19,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (7 of 50 remaining) [2021-12-18 19:19:19,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (6 of 50 remaining) [2021-12-18 19:19:19,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (5 of 50 remaining) [2021-12-18 19:19:19,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (4 of 50 remaining) [2021-12-18 19:19:19,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (3 of 50 remaining) [2021-12-18 19:19:19,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (2 of 50 remaining) [2021-12-18 19:19:19,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (1 of 50 remaining) [2021-12-18 19:19:19,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2021-12-18 19:19:19,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-18 19:19:19,160 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-18 19:19:19,163 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 19:19:19,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:19:19 BoogieIcfgContainer [2021-12-18 19:19:19,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 19:19:19,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 19:19:19,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 19:19:19,236 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 19:19:19,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12" (3/4) ... [2021-12-18 19:19:19,238 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-18 19:19:19,290 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 19:19:19,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 19:19:19,290 INFO L158 Benchmark]: Toolchain (without parser) took 7442.16ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 108.5MB in the beginning and 200.0MB in the end (delta: -91.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-18 19:19:19,291 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 79.7MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 19:19:19,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.90ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 112.1MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 19:19:19,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 144.7MB. Free memory was 112.1MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 19:19:19,294 INFO L158 Benchmark]: Boogie Preprocessor took 33.21ms. Allocated memory is still 144.7MB. Free memory was 109.9MB in the beginning and 107.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 19:19:19,294 INFO L158 Benchmark]: RCFGBuilder took 352.72ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 89.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-18 19:19:19,294 INFO L158 Benchmark]: TraceAbstraction took 6593.44ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 89.8MB in the beginning and 202.1MB in the end (delta: -112.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 19:19:19,295 INFO L158 Benchmark]: Witness Printer took 54.17ms. Allocated memory is still 251.7MB. Free memory was 202.1MB in the beginning and 200.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 19:19:19,298 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.10ms. Allocated memory is still 79.7MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.90ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 112.1MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 144.7MB. Free memory was 112.1MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.21ms. Allocated memory is still 144.7MB. Free memory was 109.9MB in the beginning and 107.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.72ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 89.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6593.44ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 89.8MB in the beginning and 202.1MB in the end (delta: -112.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 54.17ms. Allocated memory is still 251.7MB. Free memory was 202.1MB in the beginning and 200.0MB 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.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3407 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3407 mSDsluCounter, 5019 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3730 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4522 IncrementalHoareTripleChecker+Invalid, 4819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 1289 mSDtfsCounter, 4522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=18, InterpolantAutomatonStates: 180, 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, 545 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 3178 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-18 19:19:19,350 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)