./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX --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 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 10:40:42,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 10:40:42,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 10:40:42,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 10:40:42,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 10:40:42,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 10:40:42,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 10:40:42,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 10:40:42,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 10:40:42,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 10:40:42,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 10:40:42,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 10:40:42,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 10:40:42,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 10:40:42,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 10:40:42,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 10:40:42,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 10:40:42,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 10:40:42,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 10:40:42,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 10:40:42,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 10:40:42,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 10:40:42,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 10:40:42,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 10:40:42,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 10:40:42,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 10:40:42,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 10:40:42,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 10:40:42,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 10:40:42,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 10:40:42,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 10:40:42,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 10:40:42,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 10:40:42,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 10:40:42,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 10:40:42,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 10:40:42,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 10:40:42,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 10:40:42,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 10:40:42,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 10:40:42,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 10:40:42,459 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-11-09 10:40:42,503 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 10:40:42,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 10:40:42,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 10:40:42,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 10:40:42,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 10:40:42,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 10:40:42,506 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 10:40:42,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 10:40:42,506 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 10:40:42,506 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-09 10:40:42,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 10:40:42,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 10:40:42,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 10:40:42,507 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-09 10:40:42,508 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-09 10:40:42,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 10:40:42,508 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-09 10:40:42,508 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 10:40:42,508 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 10:40:42,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 10:40:42,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 10:40:42,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 10:40:42,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:40:42,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 10:40:42,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 10:40:42,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 10:40:42,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 10:40:42,511 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 10:40:42,511 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX 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 -> 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 [2021-11-09 10:40:42,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 10:40:42,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 10:40:42,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 10:40:42,793 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 10:40:42,794 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 10:40:42,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/forester-heap/dll-token-2.i [2021-11-09 10:40:42,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/data/b03c90d5e/b97010ed9fb94a7c81f3d399f7b9e6f3/FLAGd474d1ba2 [2021-11-09 10:40:43,389 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 10:40:43,390 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i [2021-11-09 10:40:43,416 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/data/b03c90d5e/b97010ed9fb94a7c81f3d399f7b9e6f3/FLAGd474d1ba2 [2021-11-09 10:40:43,676 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/data/b03c90d5e/b97010ed9fb94a7c81f3d399f7b9e6f3 [2021-11-09 10:40:43,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 10:40:43,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-09 10:40:43,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 10:40:43,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 10:40:43,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 10:40:43,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:43" (1/1) ... [2021-11-09 10:40:43,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d28bab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:43, skipping insertion in model container [2021-11-09 10:40:43,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:43" (1/1) ... [2021-11-09 10:40:43,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 10:40:43,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 10:40:44,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-11-09 10:40:44,084 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-11-09 10:40:44,088 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-11-09 10:40:44,089 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-11-09 10:40:44,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-11-09 10:40:44,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-11-09 10:40:44,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:40:44,115 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 10:40:44,155 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-11-09 10:40:44,157 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-11-09 10:40:44,159 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-11-09 10:40:44,160 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-11-09 10:40:44,161 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-11-09 10:40:44,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-11-09 10:40:44,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:40:44,196 INFO L208 MainTranslator]: Completed translation [2021-11-09 10:40:44,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44 WrapperNode [2021-11-09 10:40:44,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 10:40:44,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 10:40:44,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 10:40:44,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 10:40:44,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 10:40:44,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 10:40:44,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 10:40:44,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 10:40:44,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (1/1) ... [2021-11-09 10:40:44,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:40:44,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:40:44,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 10:40:44,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 10:40:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-09 10:40:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 10:40:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-09 10:40:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-09 10:40:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-09 10:40:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-09 10:40:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-09 10:40:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-09 10:40:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-09 10:40:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-09 10:40:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-09 10:40:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-09 10:40:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-09 10:40:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-09 10:40:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-09 10:40:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-09 10:40:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-09 10:40:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-09 10:40:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-09 10:40:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-09 10:40:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-09 10:40:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-09 10:40:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-09 10:40:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-09 10:40:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-09 10:40:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-09 10:40:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-09 10:40:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-09 10:40:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-09 10:40:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-09 10:40:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-09 10:40:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-09 10:40:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-09 10:40:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-09 10:40:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-09 10:40:44,386 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-09 10:40:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-09 10:40:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-09 10:40:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-09 10:40:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-09 10:40:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-09 10:40:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-09 10:40:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-09 10:40:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-09 10:40:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-09 10:40:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-09 10:40:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-09 10:40:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-09 10:40:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-09 10:40:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-09 10:40:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-09 10:40:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-09 10:40:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-09 10:40:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-09 10:40:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-09 10:40:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-09 10:40:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-09 10:40:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-09 10:40:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-09 10:40:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-09 10:40:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-09 10:40:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-09 10:40:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-11-09 10:40:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-09 10:40:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-09 10:40:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-11-09 10:40:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-09 10:40:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-09 10:40:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-11-09 10:40:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-09 10:40:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-09 10:40:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-09 10:40:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-09 10:40:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-09 10:40:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-09 10:40:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-09 10:40:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-09 10:40:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-09 10:40:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-09 10:40:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-09 10:40:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-09 10:40:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-09 10:40:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-09 10:40:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-09 10:40:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-09 10:40:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-09 10:40:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-09 10:40:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-09 10:40:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-09 10:40:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-09 10:40:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-09 10:40:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-09 10:40:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-09 10:40:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-09 10:40:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-09 10:40:44,401 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-09 10:40:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-09 10:40:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-09 10:40:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-09 10:40:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-09 10:40:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-09 10:40:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-09 10:40:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-09 10:40:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-09 10:40:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-09 10:40:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-09 10:40:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-09 10:40:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-09 10:40:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-09 10:40:44,404 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-09 10:40:44,404 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-09 10:40:44,404 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-09 10:40:44,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 10:40:44,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-09 10:40:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 10:40:44,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-09 10:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 10:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-09 10:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 10:40:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 10:40:44,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-09 10:40:44,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 10:40:44,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 10:40:45,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 10:40:45,171 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-11-09 10:40:45,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:45 BoogieIcfgContainer [2021-11-09 10:40:45,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 10:40:45,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 10:40:45,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 10:40:45,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 10:40:45,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:40:43" (1/3) ... [2021-11-09 10:40:45,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a98c493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:45, skipping insertion in model container [2021-11-09 10:40:45,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:44" (2/3) ... [2021-11-09 10:40:45,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a98c493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:45, skipping insertion in model container [2021-11-09 10:40:45,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:45" (3/3) ... [2021-11-09 10:40:45,185 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2021-11-09 10:40:45,192 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 10:40:45,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2021-11-09 10:40:45,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 10:40:45,255 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-11-09 10:40:45,255 INFO L340 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2021-11-09 10:40:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 72 states have (on average 2.2222222222222223) internal successors, (160), 136 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-09 10:40:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-09 10:40:45,285 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:45,286 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:45,287 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash -106181274, now seen corresponding path program 1 times [2021-11-09 10:40:45,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:45,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009345257] [2021-11-09 10:40:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:45,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:45,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:45,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009345257] [2021-11-09 10:40:45,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009345257] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:45,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:45,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:40:45,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288334785] [2021-11-09 10:40:45,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:40:45,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:40:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:40:45,661 INFO L87 Difference]: Start difference. First operand has 141 states, 72 states have (on average 2.2222222222222223) internal successors, (160), 136 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:46,100 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2021-11-09 10:40:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:40:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-11-09 10:40:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:46,117 INFO L225 Difference]: With dead ends: 158 [2021-11-09 10:40:46,117 INFO L226 Difference]: Without dead ends: 155 [2021-11-09 10:40:46,119 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:40:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-09 10:40:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2021-11-09 10:40:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 131 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2021-11-09 10:40:46,200 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 7 [2021-11-09 10:40:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:46,201 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2021-11-09 10:40:46,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2021-11-09 10:40:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-09 10:40:46,202 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:46,202 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:46,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 10:40:46,202 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash -106181273, now seen corresponding path program 1 times [2021-11-09 10:40:46,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:46,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434299983] [2021-11-09 10:40:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:46,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:46,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:46,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434299983] [2021-11-09 10:40:46,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434299983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:46,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:46,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:40:46,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70931430] [2021-11-09 10:40:46,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:40:46,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:46,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:40:46,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:40:46,338 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:46,619 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2021-11-09 10:40:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:40:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-11-09 10:40:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:46,626 INFO L225 Difference]: With dead ends: 160 [2021-11-09 10:40:46,626 INFO L226 Difference]: Without dead ends: 160 [2021-11-09 10:40:46,627 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:40:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-09 10:40:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2021-11-09 10:40:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 128 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2021-11-09 10:40:46,648 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 7 [2021-11-09 10:40:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:46,648 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2021-11-09 10:40:46,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2021-11-09 10:40:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-09 10:40:46,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:46,650 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:46,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 10:40:46,650 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 550299256, now seen corresponding path program 1 times [2021-11-09 10:40:46,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:46,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521589720] [2021-11-09 10:40:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:46,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:46,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:46,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521589720] [2021-11-09 10:40:46,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521589720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:46,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:46,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:40:46,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603847593] [2021-11-09 10:40:46,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:40:46,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:46,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:40:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:40:46,815 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:47,065 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2021-11-09 10:40:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 10:40:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-11-09 10:40:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:47,067 INFO L225 Difference]: With dead ends: 136 [2021-11-09 10:40:47,067 INFO L226 Difference]: Without dead ends: 136 [2021-11-09 10:40:47,067 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-09 10:40:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2021-11-09 10:40:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.643835616438356) internal successors, (120), 115 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2021-11-09 10:40:47,074 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 13 [2021-11-09 10:40:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:47,075 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2021-11-09 10:40:47,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2021-11-09 10:40:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-09 10:40:47,076 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:47,076 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:47,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 10:40:47,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 550299257, now seen corresponding path program 1 times [2021-11-09 10:40:47,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:47,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11688876] [2021-11-09 10:40:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:47,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:47,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:47,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11688876] [2021-11-09 10:40:47,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11688876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:47,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:47,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:40:47,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119244920] [2021-11-09 10:40:47,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:40:47,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:40:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:40:47,213 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:47,518 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2021-11-09 10:40:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:40:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-11-09 10:40:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:47,520 INFO L225 Difference]: With dead ends: 211 [2021-11-09 10:40:47,520 INFO L226 Difference]: Without dead ends: 211 [2021-11-09 10:40:47,521 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-09 10:40:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 156. [2021-11-09 10:40:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 152 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 171 transitions. [2021-11-09 10:40:47,533 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 171 transitions. Word has length 13 [2021-11-09 10:40:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:47,533 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 171 transitions. [2021-11-09 10:40:47,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2021-11-09 10:40:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-09 10:40:47,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:47,535 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:47,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 10:40:47,536 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:47,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 75654871, now seen corresponding path program 1 times [2021-11-09 10:40:47,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:47,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969373079] [2021-11-09 10:40:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:47,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:47,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:47,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:47,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969373079] [2021-11-09 10:40:47,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969373079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:47,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:47,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:40:47,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774263441] [2021-11-09 10:40:47,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:40:47,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:47,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:40:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:47,658 INFO L87 Difference]: Start difference. First operand 156 states and 171 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:47,905 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2021-11-09 10:40:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:40:47,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-11-09 10:40:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:47,907 INFO L225 Difference]: With dead ends: 155 [2021-11-09 10:40:47,907 INFO L226 Difference]: Without dead ends: 155 [2021-11-09 10:40:47,908 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:40:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-09 10:40:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-11-09 10:40:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.509090909090909) internal successors, (166), 151 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2021-11-09 10:40:47,924 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 16 [2021-11-09 10:40:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:47,924 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2021-11-09 10:40:47,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2021-11-09 10:40:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-09 10:40:47,925 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:47,926 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:47,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 10:40:47,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash 75654872, now seen corresponding path program 1 times [2021-11-09 10:40:47,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:47,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682251809] [2021-11-09 10:40:47,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:47,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:48,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:48,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:48,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682251809] [2021-11-09 10:40:48,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682251809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:48,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:48,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:40:48,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776337330] [2021-11-09 10:40:48,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:40:48,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:40:48,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:48,082 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:48,329 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2021-11-09 10:40:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 10:40:48,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-11-09 10:40:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:48,334 INFO L225 Difference]: With dead ends: 154 [2021-11-09 10:40:48,334 INFO L226 Difference]: Without dead ends: 154 [2021-11-09 10:40:48,334 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:40:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-09 10:40:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-11-09 10:40:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 110 states have (on average 1.490909090909091) internal successors, (164), 150 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2021-11-09 10:40:48,344 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 16 [2021-11-09 10:40:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:48,344 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2021-11-09 10:40:48,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2021-11-09 10:40:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-09 10:40:48,345 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:48,345 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:48,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 10:40:48,346 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash -931365320, now seen corresponding path program 1 times [2021-11-09 10:40:48,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:48,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004041827] [2021-11-09 10:40:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:48,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:48,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:48,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004041827] [2021-11-09 10:40:48,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004041827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:48,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:48,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:40:48,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308007668] [2021-11-09 10:40:48,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:40:48,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:48,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:40:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:48,431 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:48,648 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2021-11-09 10:40:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:40:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-09 10:40:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:48,650 INFO L225 Difference]: With dead ends: 153 [2021-11-09 10:40:48,650 INFO L226 Difference]: Without dead ends: 153 [2021-11-09 10:40:48,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:40:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-09 10:40:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-11-09 10:40:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 149 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2021-11-09 10:40:48,655 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 18 [2021-11-09 10:40:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:48,655 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2021-11-09 10:40:48,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2021-11-09 10:40:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-09 10:40:48,656 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:48,657 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:48,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 10:40:48,657 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:48,657 INFO L85 PathProgramCache]: Analyzing trace with hash -931365319, now seen corresponding path program 1 times [2021-11-09 10:40:48,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:48,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387910516] [2021-11-09 10:40:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:48,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:48,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:48,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387910516] [2021-11-09 10:40:48,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387910516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:48,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:48,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:40:48,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144401658] [2021-11-09 10:40:48,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:40:48,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:48,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:40:48,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:48,753 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:48,988 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2021-11-09 10:40:48,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 10:40:48,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-09 10:40:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:48,990 INFO L225 Difference]: With dead ends: 152 [2021-11-09 10:40:48,990 INFO L226 Difference]: Without dead ends: 152 [2021-11-09 10:40:48,990 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:40:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-09 10:40:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-11-09 10:40:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 148 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2021-11-09 10:40:48,995 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 18 [2021-11-09 10:40:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:48,995 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2021-11-09 10:40:48,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2021-11-09 10:40:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 10:40:48,996 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:48,996 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:48,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 10:40:48,997 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1665541607, now seen corresponding path program 1 times [2021-11-09 10:40:48,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:48,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676283588] [2021-11-09 10:40:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:48,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:49,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:49,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676283588] [2021-11-09 10:40:49,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676283588] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:49,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:49,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 10:40:49,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337091162] [2021-11-09 10:40:49,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 10:40:49,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:49,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 10:40:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-09 10:40:49,151 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:49,491 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2021-11-09 10:40:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 10:40:49,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-09 10:40:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:49,493 INFO L225 Difference]: With dead ends: 156 [2021-11-09 10:40:49,493 INFO L226 Difference]: Without dead ends: 156 [2021-11-09 10:40:49,493 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-11-09 10:40:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-09 10:40:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2021-11-09 10:40:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 147 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2021-11-09 10:40:49,498 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 20 [2021-11-09 10:40:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:49,498 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2021-11-09 10:40:49,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2021-11-09 10:40:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 10:40:49,499 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:49,499 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:49,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 10:40:49,499 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1665541606, now seen corresponding path program 1 times [2021-11-09 10:40:49,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:49,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661042761] [2021-11-09 10:40:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:49,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:49,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:49,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661042761] [2021-11-09 10:40:49,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661042761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:49,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:49,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 10:40:49,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086323742] [2021-11-09 10:40:49,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 10:40:49,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 10:40:49,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-09 10:40:49,674 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:50,306 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2021-11-09 10:40:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-09 10:40:50,306 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-09 10:40:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:50,308 INFO L225 Difference]: With dead ends: 153 [2021-11-09 10:40:50,308 INFO L226 Difference]: Without dead ends: 153 [2021-11-09 10:40:50,308 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-11-09 10:40:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-09 10:40:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2021-11-09 10:40:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.425531914893617) internal successors, (134), 123 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-11-09 10:40:50,312 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 20 [2021-11-09 10:40:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:50,313 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-11-09 10:40:50,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-11-09 10:40:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-09 10:40:50,314 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:50,314 INFO L513 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-11-09 10:40:50,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 10:40:50,314 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -815463296, now seen corresponding path program 1 times [2021-11-09 10:40:50,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:50,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745470543] [2021-11-09 10:40:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:50,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:50,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:50,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:50,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745470543] [2021-11-09 10:40:50,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745470543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:50,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:50,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 10:40:50,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359998028] [2021-11-09 10:40:50,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 10:40:50,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 10:40:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:40:50,421 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:50,791 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-11-09 10:40:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 10:40:50,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-11-09 10:40:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:50,792 INFO L225 Difference]: With dead ends: 130 [2021-11-09 10:40:50,792 INFO L226 Difference]: Without dead ends: 130 [2021-11-09 10:40:50,793 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-09 10:40:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-09 10:40:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2021-11-09 10:40:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 122 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2021-11-09 10:40:50,797 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 21 [2021-11-09 10:40:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:50,797 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2021-11-09 10:40:50,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2021-11-09 10:40:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-09 10:40:50,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:50,798 INFO L513 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-11-09 10:40:50,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 10:40:50,798 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:50,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash -815463295, now seen corresponding path program 1 times [2021-11-09 10:40:50,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:50,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562806909] [2021-11-09 10:40:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:50,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:50,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:50,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:50,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562806909] [2021-11-09 10:40:50,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562806909] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:50,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:50,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 10:40:50,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914623464] [2021-11-09 10:40:50,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 10:40:50,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 10:40:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:40:50,936 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:51,315 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2021-11-09 10:40:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 10:40:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-11-09 10:40:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:51,317 INFO L225 Difference]: With dead ends: 129 [2021-11-09 10:40:51,317 INFO L226 Difference]: Without dead ends: 129 [2021-11-09 10:40:51,317 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-09 10:40:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-09 10:40:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2021-11-09 10:40:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 121 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2021-11-09 10:40:51,321 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 21 [2021-11-09 10:40:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:51,321 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2021-11-09 10:40:51,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2021-11-09 10:40:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-09 10:40:51,322 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:51,322 INFO L513 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-11-09 10:40:51,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 10:40:51,323 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr16ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1437317817, now seen corresponding path program 1 times [2021-11-09 10:40:51,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:51,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866581580] [2021-11-09 10:40:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:51,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:51,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:51,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866581580] [2021-11-09 10:40:51,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866581580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:51,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:51,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 10:40:51,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629108059] [2021-11-09 10:40:51,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 10:40:51,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:51,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 10:40:51,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-09 10:40:51,498 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:52,071 INFO L93 Difference]: Finished difference Result 147 states and 154 transitions. [2021-11-09 10:40:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-09 10:40:52,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-11-09 10:40:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:52,073 INFO L225 Difference]: With dead ends: 147 [2021-11-09 10:40:52,073 INFO L226 Difference]: Without dead ends: 147 [2021-11-09 10:40:52,074 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2021-11-09 10:40:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-09 10:40:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 123. [2021-11-09 10:40:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 119 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-11-09 10:40:52,078 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 22 [2021-11-09 10:40:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:52,079 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-11-09 10:40:52,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-11-09 10:40:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 10:40:52,080 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:52,080 INFO L513 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-11-09 10:40:52,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 10:40:52,080 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr29ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1131965188, now seen corresponding path program 1 times [2021-11-09 10:40:52,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:52,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067568526] [2021-11-09 10:40:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:52,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:52,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:52,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067568526] [2021-11-09 10:40:52,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067568526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:52,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:52,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:40:52,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858382434] [2021-11-09 10:40:52,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:40:52,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:40:52,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:40:52,132 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:52,310 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2021-11-09 10:40:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 10:40:52,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-11-09 10:40:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:52,316 INFO L225 Difference]: With dead ends: 185 [2021-11-09 10:40:52,316 INFO L226 Difference]: Without dead ends: 185 [2021-11-09 10:40:52,317 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-09 10:40:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2021-11-09 10:40:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.391304347826087) internal successors, (128), 117 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2021-11-09 10:40:52,321 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 24 [2021-11-09 10:40:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:52,321 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2021-11-09 10:40:52,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2021-11-09 10:40:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-09 10:40:52,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:52,323 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:52,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 10:40:52,323 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr39ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash 554090547, now seen corresponding path program 1 times [2021-11-09 10:40:52,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:52,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598135300] [2021-11-09 10:40:52,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:52,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:52,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:52,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598135300] [2021-11-09 10:40:52,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598135300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:52,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:52,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 10:40:52,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53183501] [2021-11-09 10:40:52,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:40:52,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:40:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:40:52,401 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:52,571 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2021-11-09 10:40:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 10:40:52,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-11-09 10:40:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:52,573 INFO L225 Difference]: With dead ends: 119 [2021-11-09 10:40:52,573 INFO L226 Difference]: Without dead ends: 119 [2021-11-09 10:40:52,573 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:40:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-09 10:40:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-09 10:40:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 115 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2021-11-09 10:40:52,577 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 29 [2021-11-09 10:40:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:52,578 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2021-11-09 10:40:52,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2021-11-09 10:40:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-09 10:40:52,579 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:52,579 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:52,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 10:40:52,580 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr34ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash 554123318, now seen corresponding path program 1 times [2021-11-09 10:40:52,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:52,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830287367] [2021-11-09 10:40:52,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:52,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:52,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:52,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830287367] [2021-11-09 10:40:52,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830287367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:52,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:52,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-09 10:40:52,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934257509] [2021-11-09 10:40:52,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 10:40:52,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:52,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 10:40:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:40:52,871 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:53,420 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2021-11-09 10:40:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-09 10:40:53,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-11-09 10:40:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:53,422 INFO L225 Difference]: With dead ends: 223 [2021-11-09 10:40:53,422 INFO L226 Difference]: Without dead ends: 223 [2021-11-09 10:40:53,422 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2021-11-09 10:40:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-09 10:40:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 135. [2021-11-09 10:40:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 131 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2021-11-09 10:40:53,427 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 29 [2021-11-09 10:40:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:53,427 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2021-11-09 10:40:53,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2021-11-09 10:40:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 10:40:53,428 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:53,428 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:53,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 10:40:53,437 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr42REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1356236695, now seen corresponding path program 1 times [2021-11-09 10:40:53,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:53,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744833684] [2021-11-09 10:40:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:53,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:53,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:53,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744833684] [2021-11-09 10:40:53,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744833684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:53,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:53,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 10:40:53,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141906357] [2021-11-09 10:40:53,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 10:40:53,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:53,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 10:40:53,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:40:53,611 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:54,163 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2021-11-09 10:40:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-09 10:40:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-09 10:40:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:54,165 INFO L225 Difference]: With dead ends: 189 [2021-11-09 10:40:54,165 INFO L226 Difference]: Without dead ends: 189 [2021-11-09 10:40:54,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2021-11-09 10:40:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-09 10:40:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 141. [2021-11-09 10:40:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 137 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2021-11-09 10:40:54,170 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 32 [2021-11-09 10:40:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:54,170 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2021-11-09 10:40:54,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2021-11-09 10:40:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 10:40:54,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:54,171 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:54,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 10:40:54,172 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr43REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1356236696, now seen corresponding path program 1 times [2021-11-09 10:40:54,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:54,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808065151] [2021-11-09 10:40:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:54,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 10:40:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:40:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:40:54,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:40:54,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808065151] [2021-11-09 10:40:54,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808065151] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:40:54,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:40:54,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 10:40:54,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322537764] [2021-11-09 10:40:54,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 10:40:54,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:40:54,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 10:40:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:40:54,406 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:40:55,067 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2021-11-09 10:40:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-09 10:40:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-09 10:40:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:40:55,069 INFO L225 Difference]: With dead ends: 221 [2021-11-09 10:40:55,069 INFO L226 Difference]: Without dead ends: 221 [2021-11-09 10:40:55,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-11-09 10:40:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-09 10:40:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 141. [2021-11-09 10:40:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 137 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2021-11-09 10:40:55,074 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 32 [2021-11-09 10:40:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:40:55,075 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2021-11-09 10:40:55,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-09 10:40:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2021-11-09 10:40:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-09 10:40:55,076 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:40:55,076 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:55,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 10:40:55,076 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 59 more)] === [2021-11-09 10:40:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:40:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1968378007, now seen corresponding path program 1 times [2021-11-09 10:40:55,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:40:55,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90127750] [2021-11-09 10:40:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:40:55,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:40:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 10:40:55,098 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 10:40:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 10:40:55,145 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 10:40:55,145 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 10:40:55,146 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-09 10:40:55,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-11-09 10:40:55,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-11-09 10:40:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-11-09 10:40:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-11-09 10:40:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-11-09 10:40:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-11-09 10:40:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-11-09 10:40:55,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-11-09 10:40:55,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-11-09 10:40:55,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-11-09 10:40:55,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-11-09 10:40:55,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-11-09 10:40:55,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-11-09 10:40:55,150 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-11-09 10:40:55,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-11-09 10:40:55,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-11-09 10:40:55,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-11-09 10:40:55,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-11-09 10:40:55,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-11-09 10:40:55,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-11-09 10:40:55,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-11-09 10:40:55,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-11-09 10:40:55,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-11-09 10:40:55,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-11-09 10:40:55,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-11-09 10:40:55,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-11-09 10:40:55,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-11-09 10:40:55,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-11-09 10:40:55,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-11-09 10:40:55,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-11-09 10:40:55,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-11-09 10:40:55,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-11-09 10:40:55,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-11-09 10:40:55,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-11-09 10:40:55,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34ASSERT_VIOLATIONMEMORY_LEAK [2021-11-09 10:40:55,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-11-09 10:40:55,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-11-09 10:40:55,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-11-09 10:40:55,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-11-09 10:40:55,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39ASSERT_VIOLATIONMEMORY_LEAK [2021-11-09 10:40:55,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-11-09 10:40:55,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-11-09 10:40:55,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-11-09 10:40:55,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-11-09 10:40:55,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-11-09 10:40:55,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-11-09 10:40:55,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-11-09 10:40:55,156 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-11-09 10:40:55,157 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,157 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,157 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,157 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-11-09 10:40:55,157 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-11-09 10:40:55,157 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-11-09 10:40:55,158 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-11-09 10:40:55,158 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-11-09 10:40:55,158 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,158 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,158 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62ASSERT_VIOLATIONMEMORY_FREE [2021-11-09 10:40:55,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ENSURES_VIOLATIONMEMORY_LEAK [2021-11-09 10:40:55,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 10:40:55,163 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:40:55,167 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 10:40:55,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:40:55 BoogieIcfgContainer [2021-11-09 10:40:55,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 10:40:55,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 10:40:55,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 10:40:55,196 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 10:40:55,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:45" (3/4) ... [2021-11-09 10:40:55,198 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-09 10:40:55,235 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 10:40:55,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 10:40:55,236 INFO L168 Benchmark]: Toolchain (without parser) took 11553.35 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 80.5 MB in the beginning and 61.3 MB in the end (delta: 19.2 MB). Peak memory consumption was 47.4 MB. Max. memory is 16.1 GB. [2021-11-09 10:40:55,237 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 117.4 MB. Free memory is still 97.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 10:40:55,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.23 ms. Allocated memory is still 117.4 MB. Free memory was 80.3 MB in the beginning and 84.6 MB in the end (delta: -4.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 10:40:55,238 INFO L168 Benchmark]: Boogie Preprocessor took 84.45 ms. Allocated memory is still 117.4 MB. Free memory was 84.6 MB in the beginning and 81.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 10:40:55,238 INFO L168 Benchmark]: RCFGBuilder took 891.44 ms. Allocated memory is still 117.4 MB. Free memory was 81.5 MB in the beginning and 55.9 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:40:55,239 INFO L168 Benchmark]: TraceAbstraction took 10018.60 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 55.6 MB in the beginning and 63.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. [2021-11-09 10:40:55,239 INFO L168 Benchmark]: Witness Printer took 39.89 ms. Allocated memory is still 144.7 MB. Free memory was 63.4 MB in the beginning and 61.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 10:40:55,241 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.35 ms. Allocated memory is still 117.4 MB. Free memory is still 97.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 511.23 ms. Allocated memory is still 117.4 MB. Free memory was 80.3 MB in the beginning and 84.6 MB in the end (delta: -4.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.45 ms. Allocated memory is still 117.4 MB. Free memory was 84.6 MB in the beginning and 81.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 891.44 ms. Allocated memory is still 117.4 MB. Free memory was 81.5 MB in the beginning and 55.9 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10018.60 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 55.6 MB in the beginning and 63.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. * Witness Printer took 39.89 ms. Allocated memory is still 144.7 MB. Free memory was 63.4 MB in the beginning and 61.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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: 1037]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) VAL [head={-1:0}] [L1006] head->prev = ((void*)0) VAL [head={-1:0}] [L1007] head->data = 0 VAL [head={-1:0}] [L1009] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 VAL [head={-1:0}, x={-1:0}] [L1022] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1023] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1023] x->next->prev = x VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1024] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1024] x->next->data = 2 VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1026] x = head VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1035] COND FALSE !(!(1 == x->data)) [L1036] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1036] x = x->next [L1037] EXPR x->data VAL [head={-1:0}, x={-2:0}, x->data=2] [L1037] COND TRUE !(2 != x->data) [L1037] reach_error() VAL [head={-1:0}, x={-2:0}] - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: 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: 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: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1030]: 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 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: 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: 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: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: 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 4 procedures, 144 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1349 SDtfs, 2365 SDslu, 3230 SDs, 0 SdLazy, 6649 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=4, InterpolantAutomatonStates: 182, 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, 18 MinimizatonAttempts, 463 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 2468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-11-09 10:40:55,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaa8bc3c-4f88-407e-a74d-f6c4e17aae73/bin/uautomizer-IVEQpCNsaX/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)