./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt --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 6ca87716ddde5218a0bb0d9c4d67f4e1c636cb2c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:26:49,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:26:49,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:26:49,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:26:49,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:26:49,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:26:49,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:26:49,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:26:49,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:26:49,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:26:49,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:26:49,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:26:49,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:26:49,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:26:49,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:26:49,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:26:49,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:26:49,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:26:49,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:26:49,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:26:49,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:26:49,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:26:50,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:26:50,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:26:50,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:26:50,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:26:50,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:26:50,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:26:50,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:26:50,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:26:50,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:26:50,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:26:50,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:26:50,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:26:50,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:26:50,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:26:50,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:26:50,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:26:50,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:26:50,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:26:50,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:26:50,028 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-13 00:26:50,056 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:26:50,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:26:50,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:26:50,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:26:50,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:26:50,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:26:50,059 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:26:50,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:26:50,059 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:26:50,059 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:26:50,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:26:50,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:26:50,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:26:50,060 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 00:26:50,060 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 00:26:50,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:26:50,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 00:26:50,061 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:26:50,061 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:26:50,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:26:50,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:26:50,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:26:50,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:26:50,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:26:50,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:26:50,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:26:50,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:26:50,062 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:26:50,062 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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt 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 -> 6ca87716ddde5218a0bb0d9c4d67f4e1c636cb2c [2021-10-13 00:26:50,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:26:50,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:26:50,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:26:50,364 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:26:50,366 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:26:50,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2021-10-13 00:26:50,435 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/data/0e9979102/33319dd0cfb149b68094911ca8a9b305/FLAGc620c5c61 [2021-10-13 00:26:50,993 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:26:50,996 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/sv-benchmarks/c/forester-heap/sll-circular-2.i [2021-10-13 00:26:51,019 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/data/0e9979102/33319dd0cfb149b68094911ca8a9b305/FLAGc620c5c61 [2021-10-13 00:26:51,284 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/data/0e9979102/33319dd0cfb149b68094911ca8a9b305 [2021-10-13 00:26:51,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:26:51,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-13 00:26:51,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:26:51,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:26:51,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:26:51,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d8d68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51, skipping insertion in model container [2021-10-13 00:26:51,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:26:51,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:26:51,652 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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2021-10-13 00:26:51,657 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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2021-10-13 00:26:51,659 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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2021-10-13 00:26:51,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:26:51,672 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:26:51,706 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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2021-10-13 00:26:51,708 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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2021-10-13 00:26:51,709 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_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2021-10-13 00:26:51,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:26:51,742 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:26:51,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51 WrapperNode [2021-10-13 00:26:51,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:26:51,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:26:51,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:26:51,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:26:51,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:26:51,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:26:51,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:26:51,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:26:51,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (1/1) ... [2021-10-13 00:26:51,867 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:26:51,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:26:51,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:26:51,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:26:51,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-13 00:26:51,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:26:51,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-13 00:26:51,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-13 00:26:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-13 00:26:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-13 00:26:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-13 00:26:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-13 00:26:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-13 00:26:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-13 00:26:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-13 00:26:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-13 00:26:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-13 00:26:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-13 00:26:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-13 00:26:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-13 00:26:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-13 00:26:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-13 00:26:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-13 00:26:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-13 00:26:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-13 00:26:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-13 00:26:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-13 00:26:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-13 00:26:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-13 00:26:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-13 00:26:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-13 00:26:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-13 00:26:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-13 00:26:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-13 00:26:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-13 00:26:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-13 00:26:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-13 00:26:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-13 00:26:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-13 00:26:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-13 00:26:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-13 00:26:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-13 00:26:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-13 00:26:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-13 00:26:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-13 00:26:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-13 00:26:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-13 00:26:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-13 00:26:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-13 00:26:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-13 00:26:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-13 00:26:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-13 00:26:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-13 00:26:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-13 00:26:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-13 00:26:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-13 00:26:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-13 00:26:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-13 00:26:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-13 00:26:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-13 00:26:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-13 00:26:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-13 00:26:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-13 00:26:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-13 00:26:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-13 00:26:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-13 00:26:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-13 00:26:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-13 00:26:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-13 00:26:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-13 00:26:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-13 00:26:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-13 00:26:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-13 00:26:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-13 00:26:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-13 00:26:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-13 00:26:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-13 00:26:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-13 00:26:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-13 00:26:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-13 00:26:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-13 00:26:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-13 00:26:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-13 00:26:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-13 00:26:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-13 00:26:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-13 00:26:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-13 00:26:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-13 00:26:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-13 00:26:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-13 00:26:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-13 00:26:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-13 00:26:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-13 00:26:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-13 00:26:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-13 00:26:51,972 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-13 00:26:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-13 00:26:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-13 00:26:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-13 00:26:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-13 00:26:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-13 00:26:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-13 00:26:51,973 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-13 00:26:51,974 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-13 00:26:51,974 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-13 00:26:51,974 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-13 00:26:51,974 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-13 00:26:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-13 00:26:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-13 00:26:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-13 00:26:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-13 00:26:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-13 00:26:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-13 00:26:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-13 00:26:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-13 00:26:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-13 00:26:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:26:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-13 00:26:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 00:26:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 00:26:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:26:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 00:26:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 00:26:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:26:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-13 00:26:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:26:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:26:52,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:26:52,597 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-10-13 00:26:52,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:52 BoogieIcfgContainer [2021-10-13 00:26:52,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:26:52,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:26:52,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:26:52,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:26:52,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:26:51" (1/3) ... [2021-10-13 00:26:52,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b87accd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:26:52, skipping insertion in model container [2021-10-13 00:26:52,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:51" (2/3) ... [2021-10-13 00:26:52,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b87accd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:26:52, skipping insertion in model container [2021-10-13 00:26:52,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:52" (3/3) ... [2021-10-13 00:26:52,607 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2021-10-13 00:26:52,612 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:26:52,613 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2021-10-13 00:26:52,656 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:26:52,662 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, mConcurrency=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-10-13 00:26:52,662 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-10-13 00:26:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 102 states have internal predecessors, (121), 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-10-13 00:26:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 00:26:52,711 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:52,712 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:52,713 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1675934833, now seen corresponding path program 1 times [2021-10-13 00:26:52,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:52,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948074882] [2021-10-13 00:26:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:52,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:53,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:53,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948074882] [2021-10-13 00:26:53,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948074882] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:53,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:53,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:26:53,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591206631] [2021-10-13 00:26:53,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:26:53,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:53,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:26:53,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:26:53,087 INFO L87 Difference]: Start difference. First operand has 107 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 102 states have internal predecessors, (121), 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-10-13 00:26:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:53,387 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2021-10-13 00:26:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:26:53,390 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-10-13 00:26:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:53,400 INFO L225 Difference]: With dead ends: 113 [2021-10-13 00:26:53,401 INFO L226 Difference]: Without dead ends: 110 [2021-10-13 00:26:53,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:26:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-10-13 00:26:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2021-10-13 00:26:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 96 states have internal predecessors, (103), 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-10-13 00:26:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-10-13 00:26:53,461 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 7 [2021-10-13 00:26:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:53,462 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-10-13 00:26:53,462 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-10-13 00:26:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-10-13 00:26:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 00:26:53,463 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:53,463 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:53,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:26:53,464 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1675934832, now seen corresponding path program 1 times [2021-10-13 00:26:53,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:53,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904324283] [2021-10-13 00:26:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:53,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:53,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:53,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904324283] [2021-10-13 00:26:53,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904324283] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:53,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:53,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:26:53,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473818713] [2021-10-13 00:26:53,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:26:53,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:26:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:26:53,619 INFO L87 Difference]: Start difference. First operand 100 states and 106 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-10-13 00:26:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:53,819 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-10-13 00:26:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:26:53,820 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-10-13 00:26:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:53,822 INFO L225 Difference]: With dead ends: 108 [2021-10-13 00:26:53,822 INFO L226 Difference]: Without dead ends: 108 [2021-10-13 00:26:53,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:26:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-10-13 00:26:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2021-10-13 00:26:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.8) internal successors, (99), 92 states have internal predecessors, (99), 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-10-13 00:26:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-10-13 00:26:53,832 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 7 [2021-10-13 00:26:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:53,833 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-10-13 00:26:53,833 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-10-13 00:26:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-10-13 00:26:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:26:53,834 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:53,834 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:53,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:26:53,835 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash 75861693, now seen corresponding path program 1 times [2021-10-13 00:26:53,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:53,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484690456] [2021-10-13 00:26:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:53,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:53,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:53,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484690456] [2021-10-13 00:26:53,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484690456] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:53,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:53,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:26:53,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100453869] [2021-10-13 00:26:53,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:26:53,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:26:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:26:53,954 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-10-13 00:26:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:54,144 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-10-13 00:26:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:26:54,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2021-10-13 00:26:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:54,146 INFO L225 Difference]: With dead ends: 94 [2021-10-13 00:26:54,146 INFO L226 Difference]: Without dead ends: 94 [2021-10-13 00:26:54,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:26:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-10-13 00:26:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2021-10-13 00:26:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.6) internal successors, (88), 81 states have internal predecessors, (88), 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-10-13 00:26:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2021-10-13 00:26:54,154 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 12 [2021-10-13 00:26:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:54,154 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2021-10-13 00:26:54,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-10-13 00:26:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2021-10-13 00:26:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:26:54,155 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:54,155 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:54,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:26:54,156 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 75861694, now seen corresponding path program 1 times [2021-10-13 00:26:54,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:54,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267933941] [2021-10-13 00:26:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:54,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:54,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:54,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267933941] [2021-10-13 00:26:54,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267933941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:54,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:54,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:26:54,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752842293] [2021-10-13 00:26:54,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:26:54,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:26:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:26:54,242 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-10-13 00:26:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:54,432 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-10-13 00:26:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:26:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2021-10-13 00:26:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:54,434 INFO L225 Difference]: With dead ends: 105 [2021-10-13 00:26:54,434 INFO L226 Difference]: Without dead ends: 105 [2021-10-13 00:26:54,434 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:26:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-10-13 00:26:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2021-10-13 00:26:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 87 states have internal predecessors, (95), 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-10-13 00:26:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2021-10-13 00:26:54,449 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 12 [2021-10-13 00:26:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:54,449 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2021-10-13 00:26:54,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-10-13 00:26:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2021-10-13 00:26:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:26:54,450 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:54,450 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:54,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:26:54,451 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash 361683424, now seen corresponding path program 1 times [2021-10-13 00:26:54,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:54,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937997393] [2021-10-13 00:26:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:54,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:54,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:54,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937997393] [2021-10-13 00:26:54,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937997393] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:54,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:54,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:26:54,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645501888] [2021-10-13 00:26:54,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:26:54,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:54,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:26:54,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:26:54,637 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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-10-13 00:26:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:54,903 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2021-10-13 00:26:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:26:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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-10-13 00:26:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:54,905 INFO L225 Difference]: With dead ends: 174 [2021-10-13 00:26:54,906 INFO L226 Difference]: Without dead ends: 174 [2021-10-13 00:26:54,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 121.2ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:26:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-13 00:26:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 94. [2021-10-13 00:26:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.53125) internal successors, (98), 90 states have internal predecessors, (98), 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-10-13 00:26:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-10-13 00:26:54,913 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 16 [2021-10-13 00:26:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:54,914 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-10-13 00:26:54,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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-10-13 00:26:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-10-13 00:26:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:26:54,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:54,915 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:54,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:26:54,915 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash 368361480, now seen corresponding path program 1 times [2021-10-13 00:26:54,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:54,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630667588] [2021-10-13 00:26:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:54,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:54,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:54,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630667588] [2021-10-13 00:26:54,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630667588] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:54,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:54,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:26:54,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024404166] [2021-10-13 00:26:54,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:26:54,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:26:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:26:54,989 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-10-13 00:26:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:55,230 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2021-10-13 00:26:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:26:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-10-13 00:26:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:55,231 INFO L225 Difference]: With dead ends: 93 [2021-10-13 00:26:55,231 INFO L226 Difference]: Without dead ends: 93 [2021-10-13 00:26:55,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 59.2ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:26:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-13 00:26:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-10-13 00:26:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.515625) internal successors, (97), 89 states have internal predecessors, (97), 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-10-13 00:26:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-10-13 00:26:55,237 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 16 [2021-10-13 00:26:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:55,237 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-10-13 00:26:55,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-10-13 00:26:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-10-13 00:26:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:26:55,238 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:55,238 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:55,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:26:55,238 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:55,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash 368361481, now seen corresponding path program 1 times [2021-10-13 00:26:55,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:55,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741411067] [2021-10-13 00:26:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:55,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:55,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:55,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:55,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741411067] [2021-10-13 00:26:55,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741411067] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:55,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:55,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:26:55,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905314938] [2021-10-13 00:26:55,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:26:55,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:55,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:26:55,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:26:55,360 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-10-13 00:26:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:55,633 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-10-13 00:26:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:26:55,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-10-13 00:26:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:55,634 INFO L225 Difference]: With dead ends: 89 [2021-10-13 00:26:55,634 INFO L226 Difference]: Without dead ends: 89 [2021-10-13 00:26:55,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 118.5ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:26:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-10-13 00:26:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2021-10-13 00:26:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 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-10-13 00:26:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-10-13 00:26:55,639 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2021-10-13 00:26:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:55,639 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-10-13 00:26:55,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-10-13 00:26:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-10-13 00:26:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:26:55,640 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:55,640 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:55,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:26:55,641 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1672711574, now seen corresponding path program 1 times [2021-10-13 00:26:55,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:55,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304511824] [2021-10-13 00:26:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:55,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:55,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:55,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304511824] [2021-10-13 00:26:55,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304511824] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:55,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:55,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:26:55,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073751914] [2021-10-13 00:26:55,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:26:55,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:26:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:26:55,775 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-10-13 00:26:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:56,102 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2021-10-13 00:26:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:26:56,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 17 [2021-10-13 00:26:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:56,104 INFO L225 Difference]: With dead ends: 128 [2021-10-13 00:26:56,104 INFO L226 Difference]: Without dead ends: 128 [2021-10-13 00:26:56,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 122.3ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:26:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-10-13 00:26:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2021-10-13 00:26:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 83 states have internal predecessors, (92), 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-10-13 00:26:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-10-13 00:26:56,109 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 17 [2021-10-13 00:26:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:56,109 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-10-13 00:26:56,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-10-13 00:26:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-10-13 00:26:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:26:56,110 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:56,110 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:56,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:26:56,110 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:56,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1672711573, now seen corresponding path program 1 times [2021-10-13 00:26:56,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:56,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232296608] [2021-10-13 00:26:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:56,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:56,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:56,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:56,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232296608] [2021-10-13 00:26:56,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232296608] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:56,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:56,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:26:56,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769989123] [2021-10-13 00:26:56,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:26:56,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:56,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:26:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:26:56,280 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-10-13 00:26:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:56,656 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2021-10-13 00:26:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:26:56,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 17 [2021-10-13 00:26:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:56,658 INFO L225 Difference]: With dead ends: 162 [2021-10-13 00:26:56,658 INFO L226 Difference]: Without dead ends: 162 [2021-10-13 00:26:56,659 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 155.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:26:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-10-13 00:26:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 99. [2021-10-13 00:26:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 95 states have internal predecessors, (110), 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-10-13 00:26:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-10-13 00:26:56,664 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 17 [2021-10-13 00:26:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:56,664 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-10-13 00:26:56,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-10-13 00:26:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-10-13 00:26:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:26:56,669 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:56,669 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:56,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:26:56,669 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1539848306, now seen corresponding path program 1 times [2021-10-13 00:26:56,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:56,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63361153] [2021-10-13 00:26:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:56,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:56,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:56,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63361153] [2021-10-13 00:26:56,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63361153] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:56,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:56,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:26:56,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682720611] [2021-10-13 00:26:56,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 00:26:56,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:26:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:26:56,858 INFO L87 Difference]: Start difference. First operand 99 states and 113 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-10-13 00:26:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:57,269 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2021-10-13 00:26:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:26:57,270 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-10-13 00:26:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:57,271 INFO L225 Difference]: With dead ends: 147 [2021-10-13 00:26:57,271 INFO L226 Difference]: Without dead ends: 147 [2021-10-13 00:26:57,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 191.7ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-10-13 00:26:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-13 00:26:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2021-10-13 00:26:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 95 states have internal predecessors, (109), 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-10-13 00:26:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2021-10-13 00:26:57,275 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 20 [2021-10-13 00:26:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:57,276 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2021-10-13 00:26:57,276 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-10-13 00:26:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2021-10-13 00:26:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:26:57,279 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:57,279 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:57,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:26:57,282 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:57,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1539848305, now seen corresponding path program 1 times [2021-10-13 00:26:57,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:57,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018224372] [2021-10-13 00:26:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:57,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:57,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:57,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:57,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018224372] [2021-10-13 00:26:57,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018224372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:57,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:57,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:26:57,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478926997] [2021-10-13 00:26:57,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:26:57,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:26:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:26:57,496 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-10-13 00:26:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:57,885 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-10-13 00:26:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:26:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-10-13 00:26:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:57,887 INFO L225 Difference]: With dead ends: 157 [2021-10-13 00:26:57,887 INFO L226 Difference]: Without dead ends: 157 [2021-10-13 00:26:57,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 154.0ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:26:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-10-13 00:26:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2021-10-13 00:26:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.44) internal successors, (108), 95 states have internal predecessors, (108), 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-10-13 00:26:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-10-13 00:26:57,892 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 20 [2021-10-13 00:26:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:57,892 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-10-13 00:26:57,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-10-13 00:26:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-10-13 00:26:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:26:57,893 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:57,893 INFO L512 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-10-13 00:26:57,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:26:57,893 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash -490672030, now seen corresponding path program 1 times [2021-10-13 00:26:57,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:57,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671279423] [2021-10-13 00:26:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:57,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:57,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:57,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:57,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671279423] [2021-10-13 00:26:57,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671279423] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:57,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:57,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:26:57,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284940755] [2021-10-13 00:26:57,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:26:57,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:57,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:26:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:26:57,984 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-13 00:26:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:58,267 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2021-10-13 00:26:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:26:58,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-13 00:26:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:58,268 INFO L225 Difference]: With dead ends: 136 [2021-10-13 00:26:58,268 INFO L226 Difference]: Without dead ends: 136 [2021-10-13 00:26:58,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:26:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-10-13 00:26:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 100. [2021-10-13 00:26:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 96 states have internal predecessors, (110), 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-10-13 00:26:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2021-10-13 00:26:58,272 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 21 [2021-10-13 00:26:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:58,273 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-10-13 00:26:58,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-10-13 00:26:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2021-10-13 00:26:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:26:58,274 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:58,274 INFO L512 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-10-13 00:26:58,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:26:58,274 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:58,275 INFO L82 PathProgramCache]: Analyzing trace with hash -490672029, now seen corresponding path program 1 times [2021-10-13 00:26:58,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:58,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882062295] [2021-10-13 00:26:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:58,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:58,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:58,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-10-13 00:26:58,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:58,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882062295] [2021-10-13 00:26:58,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882062295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:58,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:58,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:26:58,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556301472] [2021-10-13 00:26:58,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:26:58,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:58,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:26:58,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:26:58,498 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-10-13 00:26:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:58,990 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-10-13 00:26:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:26:58,991 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-10-13 00:26:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:58,992 INFO L225 Difference]: With dead ends: 147 [2021-10-13 00:26:58,992 INFO L226 Difference]: Without dead ends: 147 [2021-10-13 00:26:58,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 263.9ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-10-13 00:26:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-13 00:26:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 119. [2021-10-13 00:26:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 115 states have internal predecessors, (143), 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-10-13 00:26:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-10-13 00:26:58,997 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 21 [2021-10-13 00:26:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:58,997 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-10-13 00:26:58,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-10-13 00:26:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-10-13 00:26:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:26:59,001 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:59,001 INFO L512 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-10-13 00:26:59,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:26:59,001 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr12ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash 858132418, now seen corresponding path program 1 times [2021-10-13 00:26:59,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:59,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292168377] [2021-10-13 00:26:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:59,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:59,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:59,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292168377] [2021-10-13 00:26:59,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292168377] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:59,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:59,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:26:59,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207079450] [2021-10-13 00:26:59,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:26:59,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:26:59,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:26:59,071 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-10-13 00:26:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:59,250 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2021-10-13 00:26:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:26:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-10-13 00:26:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:59,251 INFO L225 Difference]: With dead ends: 121 [2021-10-13 00:26:59,251 INFO L226 Difference]: Without dead ends: 121 [2021-10-13 00:26:59,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:26:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-13 00:26:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2021-10-13 00:26:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.5) internal successors, (141), 113 states have internal predecessors, (141), 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-10-13 00:26:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2021-10-13 00:26:59,256 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 21 [2021-10-13 00:26:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:59,256 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2021-10-13 00:26:59,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-10-13 00:26:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2021-10-13 00:26:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:26:59,257 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:59,257 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:26:59,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:26:59,257 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr42ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 910586449, now seen corresponding path program 1 times [2021-10-13 00:26:59,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:59,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817832807] [2021-10-13 00:26:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:59,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:59,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:26:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:26:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:26:59,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:26:59,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817832807] [2021-10-13 00:26:59,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817832807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:26:59,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:26:59,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 00:26:59,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71738183] [2021-10-13 00:26:59,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:26:59,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:26:59,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:26:59,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:26:59,516 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-10-13 00:26:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:26:59,978 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2021-10-13 00:26:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 00:26:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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 23 [2021-10-13 00:26:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:26:59,980 INFO L225 Difference]: With dead ends: 156 [2021-10-13 00:26:59,981 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 00:26:59,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 256.1ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-10-13 00:26:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 00:26:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2021-10-13 00:26:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 114 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-10-13 00:26:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2021-10-13 00:26:59,986 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 23 [2021-10-13 00:26:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:26:59,986 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2021-10-13 00:26:59,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-10-13 00:26:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2021-10-13 00:26:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:26:59,987 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:26:59,987 INFO L512 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-10-13 00:26:59,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:26:59,987 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:26:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:26:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1836590927, now seen corresponding path program 1 times [2021-10-13 00:26:59,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:26:59,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107627669] [2021-10-13 00:26:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:26:59,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:26:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:00,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:27:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:27:00,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:00,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107627669] [2021-10-13 00:27:00,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107627669] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:00,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:00,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:27:00,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144593899] [2021-10-13 00:27:00,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:27:00,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:00,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:27:00,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:00,115 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-10-13 00:27:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:00,393 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2021-10-13 00:27:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:27:00,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-10-13 00:27:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:00,395 INFO L225 Difference]: With dead ends: 148 [2021-10-13 00:27:00,395 INFO L226 Difference]: Without dead ends: 148 [2021-10-13 00:27:00,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 98.4ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:27:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-10-13 00:27:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-10-13 00:27:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 115 states have internal predecessors, (143), 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-10-13 00:27:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-10-13 00:27:00,400 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 24 [2021-10-13 00:27:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:00,400 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-10-13 00:27:00,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-10-13 00:27:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-10-13 00:27:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:27:00,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:00,403 INFO L512 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-10-13 00:27:00,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:27:00,404 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr30ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:27:00,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:00,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1392891139, now seen corresponding path program 1 times [2021-10-13 00:27:00,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:00,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969245944] [2021-10-13 00:27:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:00,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:27:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:27:00,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:00,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969245944] [2021-10-13 00:27:00,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969245944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:00,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:00,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:27:00,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972072730] [2021-10-13 00:27:00,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:27:00,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:00,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:27:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:27:00,699 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-10-13 00:27:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:01,173 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2021-10-13 00:27:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:27:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-10-13 00:27:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:01,174 INFO L225 Difference]: With dead ends: 142 [2021-10-13 00:27:01,174 INFO L226 Difference]: Without dead ends: 142 [2021-10-13 00:27:01,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 298.1ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:27:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-10-13 00:27:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2021-10-13 00:27:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 115 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-10-13 00:27:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-10-13 00:27:01,179 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 24 [2021-10-13 00:27:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:01,179 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-10-13 00:27:01,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-10-13 00:27:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-10-13 00:27:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:27:01,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:01,181 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:01,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:27:01,181 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr39ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:27:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1099697949, now seen corresponding path program 1 times [2021-10-13 00:27:01,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:01,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077043274] [2021-10-13 00:27:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:01,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:27:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:27:01,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:01,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077043274] [2021-10-13 00:27:01,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077043274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:01,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:01,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:27:01,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038480431] [2021-10-13 00:27:01,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:27:01,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:27:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:01,279 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-10-13 00:27:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:01,523 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2021-10-13 00:27:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:27:01,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 25 [2021-10-13 00:27:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:01,525 INFO L225 Difference]: With dead ends: 140 [2021-10-13 00:27:01,525 INFO L226 Difference]: Without dead ends: 140 [2021-10-13 00:27:01,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 79.0ms TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:27:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-10-13 00:27:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2021-10-13 00:27:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.469387755102041) internal successors, (144), 117 states have internal predecessors, (144), 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-10-13 00:27:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2021-10-13 00:27:01,530 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 25 [2021-10-13 00:27:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:01,531 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2021-10-13 00:27:01,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-10-13 00:27:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2021-10-13 00:27:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:27:01,532 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:01,532 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:01,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:27:01,533 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:27:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:01,533 INFO L82 PathProgramCache]: Analyzing trace with hash -230324523, now seen corresponding path program 1 times [2021-10-13 00:27:01,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:01,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48410710] [2021-10-13 00:27:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:01,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:27:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:27:01,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:01,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48410710] [2021-10-13 00:27:01,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48410710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:01,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:01,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:27:01,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195880191] [2021-10-13 00:27:01,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:27:01,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:01,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:27:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:27:01,603 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-10-13 00:27:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:01,760 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2021-10-13 00:27:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:27:01,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 25 [2021-10-13 00:27:01,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:01,763 INFO L225 Difference]: With dead ends: 122 [2021-10-13 00:27:01,764 INFO L226 Difference]: Without dead ends: 122 [2021-10-13 00:27:01,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:27:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-13 00:27:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2021-10-13 00:27:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 116 states have internal predecessors, (141), 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-10-13 00:27:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2021-10-13 00:27:01,769 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 25 [2021-10-13 00:27:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:01,773 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2021-10-13 00:27:01,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-10-13 00:27:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2021-10-13 00:27:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:27:01,775 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:01,775 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:01,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:27:01,775 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:27:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -230324522, now seen corresponding path program 1 times [2021-10-13 00:27:01,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:01,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244137920] [2021-10-13 00:27:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:01,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:27:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:27:01,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:01,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244137920] [2021-10-13 00:27:01,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244137920] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:01,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:01,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:27:01,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445983073] [2021-10-13 00:27:01,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 00:27:01,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:01,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:27:01,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:27:01,981 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-10-13 00:27:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:02,375 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2021-10-13 00:27:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 00:27:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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 25 [2021-10-13 00:27:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:02,376 INFO L225 Difference]: With dead ends: 140 [2021-10-13 00:27:02,376 INFO L226 Difference]: Without dead ends: 140 [2021-10-13 00:27:02,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 208.8ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:27:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-10-13 00:27:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2021-10-13 00:27:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 116 states have internal predecessors, (140), 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-10-13 00:27:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2021-10-13 00:27:02,380 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 25 [2021-10-13 00:27:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:02,381 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2021-10-13 00:27:02,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-10-13 00:27:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2021-10-13 00:27:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:27:02,381 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:02,382 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:02,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:27:02,382 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:27:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:02,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1584254843, now seen corresponding path program 1 times [2021-10-13 00:27:02,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:02,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956309029] [2021-10-13 00:27:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:02,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:02,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:27:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:27:02,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:02,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956309029] [2021-10-13 00:27:02,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956309029] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:02,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:02,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:02,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492087203] [2021-10-13 00:27:02,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:02,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:02,422 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-10-13 00:27:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:02,519 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2021-10-13 00:27:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:02,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2021-10-13 00:27:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:02,521 INFO L225 Difference]: With dead ends: 187 [2021-10-13 00:27:02,521 INFO L226 Difference]: Without dead ends: 187 [2021-10-13 00:27:02,521 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-10-13 00:27:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 133. [2021-10-13 00:27:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 129 states have internal predecessors, (155), 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-10-13 00:27:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2021-10-13 00:27:02,526 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 25 [2021-10-13 00:27:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:02,526 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2021-10-13 00:27:02,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-10-13 00:27:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2021-10-13 00:27:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 00:27:02,527 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:02,527 INFO L512 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] [2021-10-13 00:27:02,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:27:02,528 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr45ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:27:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash 267685108, now seen corresponding path program 1 times [2021-10-13 00:27:02,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:02,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312500104] [2021-10-13 00:27:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:02,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 00:27:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:27:02,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:02,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312500104] [2021-10-13 00:27:02,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312500104] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:02,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:02,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:27:02,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555618413] [2021-10-13 00:27:02,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 00:27:02,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:02,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:27:02,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:27:02,698 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-10-13 00:27:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:03,072 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2021-10-13 00:27:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:27:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 26 [2021-10-13 00:27:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:03,077 INFO L225 Difference]: With dead ends: 151 [2021-10-13 00:27:03,077 INFO L226 Difference]: Without dead ends: 151 [2021-10-13 00:27:03,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 166.6ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:27:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-10-13 00:27:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2021-10-13 00:27:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 129 states have internal predecessors, (154), 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-10-13 00:27:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2021-10-13 00:27:03,081 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 26 [2021-10-13 00:27:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:03,082 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2021-10-13 00:27:03,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-10-13 00:27:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2021-10-13 00:27:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 00:27:03,083 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:03,083 INFO L512 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] [2021-10-13 00:27:03,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:27:03,083 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr30ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-10-13 00:27:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981751, now seen corresponding path program 1 times [2021-10-13 00:27:03,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:03,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765586051] [2021-10-13 00:27:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:03,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:27:03,103 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:27:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:27:03,159 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:27:03,159 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:27:03,160 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr30ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:27:03,162 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-13 00:27:03,162 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-13 00:27:03,162 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-10-13 00:27:03,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-13 00:27:03,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-13 00:27:03,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-13 00:27:03,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-13 00:27:03,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-13 00:27:03,163 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-13 00:27:03,164 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-13 00:27:03,164 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-13 00:27:03,164 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-13 00:27:03,164 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:27:03,164 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-13 00:27:03,164 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-13 00:27:03,165 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-13 00:27:03,165 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-13 00:27:03,165 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 00:27:03,165 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-13 00:27:03,165 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-10-13 00:27:03,165 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-13 00:27:03,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-10-13 00:27:03,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-13 00:27:03,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-13 00:27:03,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-13 00:27:03,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-13 00:27:03,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-10-13 00:27:03,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-10-13 00:27:03,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-13 00:27:03,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-13 00:27:03,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-13 00:27:03,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-10-13 00:27:03,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-10-13 00:27:03,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-13 00:27:03,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-13 00:27:03,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-13 00:27:03,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-13 00:27:03,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-13 00:27:03,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:27:03,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:27:03,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:27:03,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:27:03,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:27:03,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 00:27:03,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ENSURES_VIOLATIONMEMORY_LEAK [2021-10-13 00:27:03,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:27:03,177 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:27:03,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:27:03 BoogieIcfgContainer [2021-10-13 00:27:03,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:27:03,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:27:03,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:27:03,233 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:27:03,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:52" (3/4) ... [2021-10-13 00:27:03,237 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:27:03,297 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:27:03,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:27:03,299 INFO L168 Benchmark]: Toolchain (without parser) took 12010.13 ms. Allocated memory was 111.1 MB in the beginning and 159.4 MB in the end (delta: 48.2 MB). Free memory was 72.3 MB in the beginning and 105.5 MB in the end (delta: -33.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:03,299 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 111.1 MB. Free memory is still 89.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:27:03,301 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.60 ms. Allocated memory is still 111.1 MB. Free memory was 72.1 MB in the beginning and 79.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:03,301 INFO L168 Benchmark]: Boogie Preprocessor took 97.53 ms. Allocated memory is still 111.1 MB. Free memory was 79.5 MB in the beginning and 76.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:03,303 INFO L168 Benchmark]: RCFGBuilder took 750.14 ms. Allocated memory is still 111.1 MB. Free memory was 76.7 MB in the beginning and 53.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:03,303 INFO L168 Benchmark]: TraceAbstraction took 10631.48 ms. Allocated memory was 111.1 MB in the beginning and 159.4 MB in the end (delta: 48.2 MB). Free memory was 52.7 MB in the beginning and 107.6 MB in the end (delta: -54.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:27:03,304 INFO L168 Benchmark]: Witness Printer took 64.67 ms. Allocated memory is still 159.4 MB. Free memory was 107.6 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:03,306 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.24 ms. Allocated memory is still 111.1 MB. Free memory is still 89.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 453.60 ms. Allocated memory is still 111.1 MB. Free memory was 72.1 MB in the beginning and 79.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.53 ms. Allocated memory is still 111.1 MB. Free memory was 79.5 MB in the beginning and 76.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 750.14 ms. Allocated memory is still 111.1 MB. Free memory was 76.7 MB in the beginning and 53.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10631.48 ms. Allocated memory was 111.1 MB in the beginning and 159.4 MB in the end (delta: 48.2 MB). Free memory was 52.7 MB in the beginning and 107.6 MB in the end (delta: -54.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 64.67 ms. Allocated memory is still 159.4 MB. Free memory was 107.6 MB in the beginning and 105.5 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1032]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head VAL [head={-1:0}] [L998] head->data = 0 VAL [head={-1:0}] [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, state=1, x={-1:0}] [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: 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: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: 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 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 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 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: 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: 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: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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, 110 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 10520.1ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 54.9ms, AutomataDifference: 6711.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1414 SDtfs, 3580 SDslu, 4386 SDs, 0 SdLazy, 6077 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3881.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2603.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=21, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 149.9ms AutomataMinimizationTime, 22 MinimizatonAttempts, 610 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 52.1ms SsaConstructionTime, 298.0ms SatisfiabilityAnalysisTime, 2776.8ms InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 3744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-10-13 00:27:03,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84a46d3a-d31a-43c9-b7bc-d1b9f9af7fba/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...