./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:34:00,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:34:00,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:34:00,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:34:00,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:34:00,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:34:00,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:34:00,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:34:00,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:34:00,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:34:00,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:34:00,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:34:00,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:34:00,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:34:00,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:34:00,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:34:00,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:34:00,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:34:01,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:34:01,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:34:01,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:34:01,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:34:01,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:34:01,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:34:01,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:34:01,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:34:01,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:34:01,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:34:01,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:34:01,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:34:01,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:34:01,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:34:01,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:34:01,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:34:01,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:34:01,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:34:01,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:34:01,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:34:01,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:34:01,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:34:01,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:34:01,046 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-20 07:34:01,096 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:34:01,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:34:01,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:34:01,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:34:01,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:34:01,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:34:01,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:34:01,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:34:01,100 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:34:01,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:34:01,102 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:34:01,102 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 07:34:01,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:34:01,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:34:01,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:34:01,103 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 07:34:01,103 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 07:34:01,103 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 07:34:01,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:34:01,104 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 07:34:01,104 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:34:01,104 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:34:01,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:34:01,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:34:01,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:34:01,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:34:01,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:34:01,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:34:01,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:34:01,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:34:01,108 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:34:01,108 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_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/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_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2021-11-20 07:34:01,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:34:01,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:34:01,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:34:01,477 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:34:01,478 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:34:01,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2021-11-20 07:34:01,547 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/data/89635f2c2/cafaf791cf784eae87656d51cec3f05b/FLAG9819d2f2a [2021-11-20 07:34:02,198 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:34:02,199 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2021-11-20 07:34:02,230 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/data/89635f2c2/cafaf791cf784eae87656d51cec3f05b/FLAG9819d2f2a [2021-11-20 07:34:02,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/data/89635f2c2/cafaf791cf784eae87656d51cec3f05b [2021-11-20 07:34:02,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:34:02,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:34:02,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:34:02,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:34:02,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:34:02,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:34:02" (1/1) ... [2021-11-20 07:34:02,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa6ce83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:02, skipping insertion in model container [2021-11-20 07:34:02,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:34:02" (1/1) ... [2021-11-20 07:34:02,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:34:02,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:34:02,853 WARN L230 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_20c36658-a108-481d-aa37-ca7bb4760d45/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2021-11-20 07:34:02,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:34:02,874 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:34:02,958 WARN L230 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_20c36658-a108-481d-aa37-ca7bb4760d45/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2021-11-20 07:34:02,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:34:03,000 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:34:03,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03 WrapperNode [2021-11-20 07:34:03,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:34:03,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:34:03,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:34:03,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:34:03,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,054 INFO L137 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2021-11-20 07:34:03,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:34:03,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:34:03,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:34:03,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:34:03,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:34:03,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:34:03,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:34:03,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:34:03,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (1/1) ... [2021-11-20 07:34:03,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:34:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:03,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:34:03,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:34:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 07:34:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 07:34:03,202 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 07:34:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 07:34:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:34:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:34:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 07:34:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 07:34:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:34:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 07:34:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:34:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:34:03,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:34:03,303 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:34:03,319 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:34:03,741 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:34:03,749 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:34:03,749 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-20 07:34:03,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:34:03 BoogieIcfgContainer [2021-11-20 07:34:03,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:34:03,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:34:03,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:34:03,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:34:03,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:34:02" (1/3) ... [2021-11-20 07:34:03,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a21cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:34:03, skipping insertion in model container [2021-11-20 07:34:03,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:34:03" (2/3) ... [2021-11-20 07:34:03,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a21cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:34:03, skipping insertion in model container [2021-11-20 07:34:03,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:34:03" (3/3) ... [2021-11-20 07:34:03,763 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2021-11-20 07:34:03,769 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:34:03,769 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-11-20 07:34:03,815 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:34:03,823 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:34:03,824 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-11-20 07:34:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 07:34:03,850 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:03,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 07:34:03,851 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 893736149, now seen corresponding path program 1 times [2021-11-20 07:34:03,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:03,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157952592] [2021-11-20 07:34:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:03,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:34:04,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:04,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157952592] [2021-11-20 07:34:04,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157952592] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:04,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:04,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:34:04,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940479952] [2021-11-20 07:34:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:04,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:34:04,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:34:04,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:34:04,139 INFO L87 Difference]: Start difference. First operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:34:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:04,272 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-11-20 07:34:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:34:04,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 07:34:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:04,283 INFO L225 Difference]: With dead ends: 91 [2021-11-20 07:34:04,283 INFO L226 Difference]: Without dead ends: 88 [2021-11-20 07:34:04,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:34:04,289 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:04,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-20 07:34:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-11-20 07:34:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-11-20 07:34:04,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 6 [2021-11-20 07:34:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:04,334 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-11-20 07:34:04,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:34:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-11-20 07:34:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-20 07:34:04,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:04,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-20 07:34:04,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:34:04,335 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 893736150, now seen corresponding path program 1 times [2021-11-20 07:34:04,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:04,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072342639] [2021-11-20 07:34:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:04,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:34:04,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:04,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072342639] [2021-11-20 07:34:04,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072342639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:04,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:04,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:34:04,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878866161] [2021-11-20 07:34:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:04,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:34:04,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:04,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:34:04,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:34:04,400 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:34:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:04,469 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2021-11-20 07:34:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:34:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-20 07:34:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:04,471 INFO L225 Difference]: With dead ends: 86 [2021-11-20 07:34:04,471 INFO L226 Difference]: Without dead ends: 86 [2021-11-20 07:34:04,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:34:04,473 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:04,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-20 07:34:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-11-20 07:34:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-11-20 07:34:04,485 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 6 [2021-11-20 07:34:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:04,486 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-11-20 07:34:04,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:34:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2021-11-20 07:34:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 07:34:04,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:04,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:04,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:34:04,488 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1919809879, now seen corresponding path program 1 times [2021-11-20 07:34:04,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:04,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829743024] [2021-11-20 07:34:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:04,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:34:04,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:04,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829743024] [2021-11-20 07:34:04,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829743024] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:04,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:04,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:34:04,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502509358] [2021-11-20 07:34:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:04,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:34:04,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:04,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:34:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:34:04,583 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 07:34:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:04,685 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2021-11-20 07:34:04,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:34:04,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-11-20 07:34:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:04,693 INFO L225 Difference]: With dead ends: 93 [2021-11-20 07:34:04,693 INFO L226 Difference]: Without dead ends: 93 [2021-11-20 07:34:04,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:34:04,701 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:04,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-20 07:34:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2021-11-20 07:34:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-11-20 07:34:04,722 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 13 [2021-11-20 07:34:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:04,723 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-11-20 07:34:04,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 07:34:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-11-20 07:34:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 07:34:04,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:04,725 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:04,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:34:04,726 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 951797020, now seen corresponding path program 1 times [2021-11-20 07:34:04,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:04,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52998652] [2021-11-20 07:34:04,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:04,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:04,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 07:34:04,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:04,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52998652] [2021-11-20 07:34:04,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52998652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:04,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:04,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:34:04,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272769760] [2021-11-20 07:34:04,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:04,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:34:04,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:34:04,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:34:04,963 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:05,212 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2021-11-20 07:34:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:34:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-20 07:34:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:05,216 INFO L225 Difference]: With dead ends: 141 [2021-11-20 07:34:05,216 INFO L226 Difference]: Without dead ends: 141 [2021-11-20 07:34:05,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:34:05,218 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 67 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:05,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 245 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:34:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-20 07:34:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 86. [2021-11-20 07:34:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-11-20 07:34:05,228 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 22 [2021-11-20 07:34:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:05,228 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-11-20 07:34:05,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2021-11-20 07:34:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 07:34:05,230 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:05,230 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:05,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:34:05,230 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash 951797021, now seen corresponding path program 1 times [2021-11-20 07:34:05,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:05,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411923841] [2021-11-20 07:34:05,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:05,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:05,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:05,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411923841] [2021-11-20 07:34:05,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411923841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:05,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:05,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:34:05,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342020046] [2021-11-20 07:34:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:05,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:34:05,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:34:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:34:05,368 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:05,581 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2021-11-20 07:34:05,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:34:05,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-11-20 07:34:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:05,585 INFO L225 Difference]: With dead ends: 86 [2021-11-20 07:34:05,585 INFO L226 Difference]: Without dead ends: 86 [2021-11-20 07:34:05,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:34:05,587 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:05,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 231 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:34:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-20 07:34:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-11-20 07:34:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2021-11-20 07:34:05,594 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 22 [2021-11-20 07:34:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:05,594 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-11-20 07:34:05,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2021-11-20 07:34:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 07:34:05,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:05,596 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:05,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:34:05,596 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash -389076539, now seen corresponding path program 1 times [2021-11-20 07:34:05,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:05,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703930097] [2021-11-20 07:34:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:05,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 07:34:05,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:05,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703930097] [2021-11-20 07:34:05,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703930097] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:05,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235540095] [2021-11-20 07:34:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:05,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:05,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:05,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:05,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:34:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:05,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 07:34:05,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:05,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 07:34:06,103 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 07:34:06,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-20 07:34:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:06,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:34:06,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235540095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:06,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:34:06,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2021-11-20 07:34:06,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478916871] [2021-11-20 07:34:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:06,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 07:34:06,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:06,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 07:34:06,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:34:06,172 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:06,471 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2021-11-20 07:34:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:34:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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) Word has length 25 [2021-11-20 07:34:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:06,473 INFO L225 Difference]: With dead ends: 140 [2021-11-20 07:34:06,473 INFO L226 Difference]: Without dead ends: 140 [2021-11-20 07:34:06,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:34:06,475 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 122 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:06,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 354 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:34:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-20 07:34:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 84. [2021-11-20 07:34:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.826086956521739) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-11-20 07:34:06,483 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 25 [2021-11-20 07:34:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:06,484 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-11-20 07:34:06,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-11-20 07:34:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 07:34:06,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:06,485 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:06,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:06,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-20 07:34:06,711 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash -389076538, now seen corresponding path program 1 times [2021-11-20 07:34:06,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119536282] [2021-11-20 07:34:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:06,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:06,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 07:34:06,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119536282] [2021-11-20 07:34:06,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119536282] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487928230] [2021-11-20 07:34:06,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:06,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:06,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:06,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:06,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 07:34:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:06,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 07:34:06,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:06,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 07:34:07,164 INFO L354 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2021-11-20 07:34:07,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 9 [2021-11-20 07:34:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:07,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:34:07,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487928230] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:07,355 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 07:34:07,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2021-11-20 07:34:07,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195168713] [2021-11-20 07:34:07,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 07:34:07,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 07:34:07,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 07:34:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:34:07,357 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 07:34:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:07,705 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-11-20 07:34:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:34:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-11-20 07:34:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:07,706 INFO L225 Difference]: With dead ends: 83 [2021-11-20 07:34:07,706 INFO L226 Difference]: Without dead ends: 83 [2021-11-20 07:34:07,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:34:07,708 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:07,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 481 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:34:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-20 07:34:07,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-11-20 07:34:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2021-11-20 07:34:07,714 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 25 [2021-11-20 07:34:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:07,714 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2021-11-20 07:34:07,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 07:34:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2021-11-20 07:34:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-20 07:34:07,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:07,715 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:07,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:07,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-20 07:34:07,943 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 904455987, now seen corresponding path program 1 times [2021-11-20 07:34:07,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458636585] [2021-11-20 07:34:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:07,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:08,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:08,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458636585] [2021-11-20 07:34:08,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458636585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:08,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:08,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:34:08,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011197018] [2021-11-20 07:34:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:08,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:34:08,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:34:08,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:34:08,014 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:08,101 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2021-11-20 07:34:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:34:08,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-11-20 07:34:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:08,105 INFO L225 Difference]: With dead ends: 138 [2021-11-20 07:34:08,105 INFO L226 Difference]: Without dead ends: 138 [2021-11-20 07:34:08,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:34:08,109 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 178 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:08,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 188 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-20 07:34:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 84. [2021-11-20 07:34:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-11-20 07:34:08,127 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 29 [2021-11-20 07:34:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:08,127 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-11-20 07:34:08,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-11-20 07:34:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-20 07:34:08,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:08,130 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:08,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:34:08,131 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash 904455976, now seen corresponding path program 1 times [2021-11-20 07:34:08,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:08,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508173677] [2021-11-20 07:34:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:08,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:08,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:08,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508173677] [2021-11-20 07:34:08,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508173677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:08,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:08,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:34:08,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124727831] [2021-11-20 07:34:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:08,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:34:08,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:34:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:34:08,342 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:08,510 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2021-11-20 07:34:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:34:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-11-20 07:34:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:08,511 INFO L225 Difference]: With dead ends: 120 [2021-11-20 07:34:08,512 INFO L226 Difference]: Without dead ends: 120 [2021-11-20 07:34:08,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:34:08,513 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 136 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:08,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 110 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-20 07:34:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 80. [2021-11-20 07:34:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.6875) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-11-20 07:34:08,517 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 29 [2021-11-20 07:34:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:08,517 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-11-20 07:34:08,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-11-20 07:34:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-20 07:34:08,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:08,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:08,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:34:08,527 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:08,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 904455977, now seen corresponding path program 1 times [2021-11-20 07:34:08,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:08,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182658983] [2021-11-20 07:34:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:08,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:34:08,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:08,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182658983] [2021-11-20 07:34:08,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182658983] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:08,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648522920] [2021-11-20 07:34:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:08,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:08,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:08,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 07:34:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:08,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 07:34:08,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:08,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 07:34:08,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-11-20 07:34:09,068 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 07:34:09,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-20 07:34:09,192 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 07:34:09,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2021-11-20 07:34:09,309 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-20 07:34:09,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 32 [2021-11-20 07:34:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:34:09,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:34:11,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648522920] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:11,692 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 07:34:11,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-11-20 07:34:11,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709901467] [2021-11-20 07:34:11,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 07:34:11,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 07:34:11,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 07:34:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=215, Unknown=1, NotChecked=0, Total=272 [2021-11-20 07:34:11,694 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 07:34:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:11,893 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2021-11-20 07:34:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:34:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2021-11-20 07:34:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:11,895 INFO L225 Difference]: With dead ends: 98 [2021-11-20 07:34:11,895 INFO L226 Difference]: Without dead ends: 98 [2021-11-20 07:34:11,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=61, Invalid=244, Unknown=1, NotChecked=0, Total=306 [2021-11-20 07:34:11,896 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:11,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 314 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2021-11-20 07:34:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-20 07:34:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-20 07:34:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 92 states have internal predecessors, (97), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-11-20 07:34:11,901 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 29 [2021-11-20 07:34:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:11,902 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-11-20 07:34:11,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 07:34:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-11-20 07:34:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 07:34:11,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:11,903 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:11,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:12,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:12,127 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2026635805, now seen corresponding path program 1 times [2021-11-20 07:34:12,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:12,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843078860] [2021-11-20 07:34:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:12,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:12,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 07:34:12,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:12,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843078860] [2021-11-20 07:34:12,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843078860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:12,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:12,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:34:12,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124785986] [2021-11-20 07:34:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:12,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 07:34:12,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 07:34:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:34:12,289 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:12,770 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2021-11-20 07:34:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 07:34:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-11-20 07:34:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:12,772 INFO L225 Difference]: With dead ends: 137 [2021-11-20 07:34:12,772 INFO L226 Difference]: Without dead ends: 137 [2021-11-20 07:34:12,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-11-20 07:34:12,773 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 200 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:12,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 391 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:34:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-20 07:34:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2021-11-20 07:34:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.546875) internal successors, (99), 93 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-11-20 07:34:12,779 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 30 [2021-11-20 07:34:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:12,780 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-11-20 07:34:12,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-11-20 07:34:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 07:34:12,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:12,781 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:12,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 07:34:12,781 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2026635804, now seen corresponding path program 1 times [2021-11-20 07:34:12,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:12,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963871967] [2021-11-20 07:34:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:12,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:12,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:12,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963871967] [2021-11-20 07:34:12,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963871967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:12,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:12,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:34:12,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513174813] [2021-11-20 07:34:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:12,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 07:34:12,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:12,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 07:34:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:34:12,995 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:13,468 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2021-11-20 07:34:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:34:13,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-11-20 07:34:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:13,470 INFO L225 Difference]: With dead ends: 131 [2021-11-20 07:34:13,470 INFO L226 Difference]: Without dead ends: 131 [2021-11-20 07:34:13,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-11-20 07:34:13,471 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 364 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:13,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 312 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:34:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-20 07:34:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 99. [2021-11-20 07:34:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.53125) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2021-11-20 07:34:13,476 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 30 [2021-11-20 07:34:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:13,477 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2021-11-20 07:34:13,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2021-11-20 07:34:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 07:34:13,478 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:13,478 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:13,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 07:34:13,479 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:13,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1976823067, now seen corresponding path program 1 times [2021-11-20 07:34:13,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:13,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172240719] [2021-11-20 07:34:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:13,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:13,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:13,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:13,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:13,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172240719] [2021-11-20 07:34:13,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172240719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:13,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:13,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:34:13,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772687554] [2021-11-20 07:34:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:13,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:34:13,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:34:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:34:13,563 INFO L87 Difference]: Start difference. First operand 99 states and 106 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), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:13,670 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-11-20 07:34:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:34:13,671 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), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-11-20 07:34:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:13,672 INFO L225 Difference]: With dead ends: 92 [2021-11-20 07:34:13,672 INFO L226 Difference]: Without dead ends: 92 [2021-11-20 07:34:13,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:34:13,673 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 103 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:13,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 121 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-20 07:34:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-11-20 07:34:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.421875) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-11-20 07:34:13,677 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 32 [2021-11-20 07:34:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:13,678 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-11-20 07:34:13,678 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), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-11-20 07:34:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 07:34:13,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:13,679 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:13,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 07:34:13,680 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1055563858, now seen corresponding path program 1 times [2021-11-20 07:34:13,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:13,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284051313] [2021-11-20 07:34:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:13,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:13,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:13,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284051313] [2021-11-20 07:34:13,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284051313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:13,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:13,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:34:13,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54339763] [2021-11-20 07:34:13,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:13,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 07:34:13,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 07:34:13,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:34:13,823 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:14,199 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2021-11-20 07:34:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 07:34:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-11-20 07:34:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:14,201 INFO L225 Difference]: With dead ends: 141 [2021-11-20 07:34:14,201 INFO L226 Difference]: Without dead ends: 141 [2021-11-20 07:34:14,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-11-20 07:34:14,202 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 380 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:14,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 380 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:34:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-20 07:34:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 104. [2021-11-20 07:34:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 98 states have internal predecessors, (112), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2021-11-20 07:34:14,208 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 35 [2021-11-20 07:34:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:14,208 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2021-11-20 07:34:14,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2021-11-20 07:34:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 07:34:14,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:14,209 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:14,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 07:34:14,209 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1636827734, now seen corresponding path program 1 times [2021-11-20 07:34:14,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:14,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478393322] [2021-11-20 07:34:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:14,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:14,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:14,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:14,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478393322] [2021-11-20 07:34:14,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478393322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:14,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:14,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:34:14,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672343072] [2021-11-20 07:34:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:14,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:34:14,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:34:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:34:14,287 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:14,441 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2021-11-20 07:34:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:34:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-11-20 07:34:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:14,443 INFO L225 Difference]: With dead ends: 104 [2021-11-20 07:34:14,443 INFO L226 Difference]: Without dead ends: 104 [2021-11-20 07:34:14,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:34:14,444 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 37 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:14,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 200 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-20 07:34:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-11-20 07:34:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 97 states have internal predecessors, (112), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2021-11-20 07:34:14,449 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 36 [2021-11-20 07:34:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:14,449 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2021-11-20 07:34:14,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2021-11-20 07:34:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 07:34:14,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:14,450 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:14,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-20 07:34:14,451 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1636827733, now seen corresponding path program 1 times [2021-11-20 07:34:14,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:14,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770359942] [2021-11-20 07:34:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:14,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:14,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:14,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:14,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770359942] [2021-11-20 07:34:14,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770359942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:14,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:14,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 07:34:14,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501017215] [2021-11-20 07:34:14,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:14,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 07:34:14,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:14,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 07:34:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:34:14,728 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:15,375 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2021-11-20 07:34:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 07:34:15,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-11-20 07:34:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:15,377 INFO L225 Difference]: With dead ends: 152 [2021-11-20 07:34:15,377 INFO L226 Difference]: Without dead ends: 152 [2021-11-20 07:34:15,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2021-11-20 07:34:15,379 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 368 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:15,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 424 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:34:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-20 07:34:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2021-11-20 07:34:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 107 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2021-11-20 07:34:15,385 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 36 [2021-11-20 07:34:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:15,385 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2021-11-20 07:34:15,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2021-11-20 07:34:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 07:34:15,386 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:15,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:15,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-20 07:34:15,387 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1637258683, now seen corresponding path program 1 times [2021-11-20 07:34:15,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:15,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068857471] [2021-11-20 07:34:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:15,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:15,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:15,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068857471] [2021-11-20 07:34:15,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068857471] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:15,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:15,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:34:15,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978608305] [2021-11-20 07:34:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:15,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 07:34:15,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:15,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 07:34:15,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:34:15,570 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:15,966 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2021-11-20 07:34:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 07:34:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-11-20 07:34:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:15,972 INFO L225 Difference]: With dead ends: 131 [2021-11-20 07:34:15,973 INFO L226 Difference]: Without dead ends: 131 [2021-11-20 07:34:15,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-11-20 07:34:15,974 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 282 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:15,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 310 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:34:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-20 07:34:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2021-11-20 07:34:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 110 states have internal predecessors, (127), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2021-11-20 07:34:15,979 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 36 [2021-11-20 07:34:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:15,980 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2021-11-20 07:34:15,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2021-11-20 07:34:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 07:34:15,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:15,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:15,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-20 07:34:15,981 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash 784588468, now seen corresponding path program 1 times [2021-11-20 07:34:15,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:15,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537393036] [2021-11-20 07:34:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:15,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:16,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:16,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537393036] [2021-11-20 07:34:16,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537393036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:16,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:16,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:34:16,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249659793] [2021-11-20 07:34:16,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:16,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:34:16,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:16,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:34:16,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:34:16,062 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:16,193 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2021-11-20 07:34:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:34:16,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-11-20 07:34:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:16,195 INFO L225 Difference]: With dead ends: 115 [2021-11-20 07:34:16,195 INFO L226 Difference]: Without dead ends: 115 [2021-11-20 07:34:16,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:34:16,196 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 23 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:16,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 181 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-20 07:34:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-11-20 07:34:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 109 states have internal predecessors, (125), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2021-11-20 07:34:16,202 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 37 [2021-11-20 07:34:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:16,202 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2021-11-20 07:34:16,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2021-11-20 07:34:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-20 07:34:16,203 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:16,203 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:16,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-20 07:34:16,204 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1447561176, now seen corresponding path program 1 times [2021-11-20 07:34:16,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:16,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968861088] [2021-11-20 07:34:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:16,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:16,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:16,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968861088] [2021-11-20 07:34:16,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968861088] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:16,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279131481] [2021-11-20 07:34:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:16,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:16,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:16,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:16,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 07:34:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:16,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 07:34:16,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:16,727 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 07:34:16,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2021-11-20 07:34:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:16,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:34:16,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279131481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:16,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:34:16,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2021-11-20 07:34:16,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564385185] [2021-11-20 07:34:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:16,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:34:16,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:34:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-11-20 07:34:16,771 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:16,977 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2021-11-20 07:34:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:34:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-11-20 07:34:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:16,979 INFO L225 Difference]: With dead ends: 165 [2021-11-20 07:34:16,979 INFO L226 Difference]: Without dead ends: 165 [2021-11-20 07:34:16,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-11-20 07:34:16,981 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 120 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:16,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 224 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2021-11-20 07:34:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-20 07:34:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2021-11-20 07:34:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 137 states have internal predecessors, (171), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 179 transitions. [2021-11-20 07:34:16,988 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 179 transitions. Word has length 38 [2021-11-20 07:34:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:16,989 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 179 transitions. [2021-11-20 07:34:16,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 179 transitions. [2021-11-20 07:34:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 07:34:16,990 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:16,990 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:17,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:17,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:17,211 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1290238871, now seen corresponding path program 2 times [2021-11-20 07:34:17,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:17,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471868994] [2021-11-20 07:34:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:17,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:17,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:17,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:34:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:34:17,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:17,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471868994] [2021-11-20 07:34:17,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471868994] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:17,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380563232] [2021-11-20 07:34:17,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 07:34:17,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:17,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:17,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:17,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 07:34:17,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 07:34:17,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 07:34:17,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:34:17,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:34:17,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:34:17,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380563232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:17,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:34:17,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-11-20 07:34:17,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439773627] [2021-11-20 07:34:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:17,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:34:17,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:17,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:34:17,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:34:17,507 INFO L87 Difference]: Start difference. First operand 143 states and 179 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 07:34:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:17,519 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2021-11-20 07:34:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:34:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2021-11-20 07:34:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:17,522 INFO L225 Difference]: With dead ends: 125 [2021-11-20 07:34:17,522 INFO L226 Difference]: Without dead ends: 125 [2021-11-20 07:34:17,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:34:17,523 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 108 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:17,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 80 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:34:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-20 07:34:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-11-20 07:34:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 121 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2021-11-20 07:34:17,530 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 41 [2021-11-20 07:34:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:17,530 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2021-11-20 07:34:17,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 07:34:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2021-11-20 07:34:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 07:34:17,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:17,531 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:17,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:17,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-20 07:34:17,751 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash -306294352, now seen corresponding path program 1 times [2021-11-20 07:34:17,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:17,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804534283] [2021-11-20 07:34:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:17,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:17,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:17,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:17,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804534283] [2021-11-20 07:34:17,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804534283] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:17,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:17,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 07:34:17,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169051216] [2021-11-20 07:34:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:17,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 07:34:17,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:17,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 07:34:17,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:34:17,961 INFO L87 Difference]: Start difference. First operand 125 states and 157 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:18,361 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2021-11-20 07:34:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:34:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2021-11-20 07:34:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:18,364 INFO L225 Difference]: With dead ends: 134 [2021-11-20 07:34:18,364 INFO L226 Difference]: Without dead ends: 134 [2021-11-20 07:34:18,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-11-20 07:34:18,365 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:18,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 428 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:34:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-20 07:34:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2021-11-20 07:34:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 124 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2021-11-20 07:34:18,370 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 41 [2021-11-20 07:34:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:18,370 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2021-11-20 07:34:18,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2021-11-20 07:34:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 07:34:18,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:18,380 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:18,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-20 07:34:18,380 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash -306241737, now seen corresponding path program 1 times [2021-11-20 07:34:18,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:18,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216187870] [2021-11-20 07:34:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:18,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:18,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:18,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216187870] [2021-11-20 07:34:18,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216187870] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:18,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782768955] [2021-11-20 07:34:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:18,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:18,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:18,772 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:18,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 07:34:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:18,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-20 07:34:18,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:18,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 07:34:19,198 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-20 07:34:19,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-20 07:34:19,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:34:19,485 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 07:34:19,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-11-20 07:34:19,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2021-11-20 07:34:20,331 INFO L354 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2021-11-20 07:34:20,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 36 [2021-11-20 07:34:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:34:20,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:34:20,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2021-11-20 07:34:22,357 INFO L354 Elim1Store]: treesize reduction 19, result has 67.2 percent of original size [2021-11-20 07:34:22,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 699 treesize of output 689 [2021-11-20 07:34:41,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782768955] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:41,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 07:34:41,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2021-11-20 07:34:41,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438249034] [2021-11-20 07:34:41,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 07:34:41,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-20 07:34:41,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-20 07:34:41,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2473, Unknown=1, NotChecked=0, Total=2652 [2021-11-20 07:34:41,290 INFO L87 Difference]: Start difference. First operand 128 states and 159 transitions. Second operand has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 35 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:42,030 INFO L93 Difference]: Finished difference Result 130 states and 162 transitions. [2021-11-20 07:34:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 07:34:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 35 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2021-11-20 07:34:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:42,037 INFO L225 Difference]: With dead ends: 130 [2021-11-20 07:34:42,037 INFO L226 Difference]: Without dead ends: 130 [2021-11-20 07:34:42,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=244, Invalid=3061, Unknown=1, NotChecked=0, Total=3306 [2021-11-20 07:34:42,039 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:42,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 825 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 617 Invalid, 0 Unknown, 143 Unchecked, 0.4s Time] [2021-11-20 07:34:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-20 07:34:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-11-20 07:34:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.462962962962963) internal successors, (158), 126 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2021-11-20 07:34:42,046 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 41 [2021-11-20 07:34:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:42,046 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2021-11-20 07:34:42,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 35 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 07:34:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2021-11-20 07:34:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 07:34:42,047 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:42,048 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:42,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:42,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-20 07:34:42,271 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -306241736, now seen corresponding path program 1 times [2021-11-20 07:34:42,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:42,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962086507] [2021-11-20 07:34:42,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:42,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:34:42,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962086507] [2021-11-20 07:34:42,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962086507] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146018114] [2021-11-20 07:34:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:42,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:42,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:42,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:42,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 07:34:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:43,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 92 conjunts are in the unsatisfiable core [2021-11-20 07:34:43,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:43,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 07:34:43,409 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 07:34:43,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 07:34:43,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:34:43,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:34:43,721 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-20 07:34:43,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 45 [2021-11-20 07:34:43,735 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 07:34:43,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2021-11-20 07:34:44,633 INFO L354 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2021-11-20 07:34:44,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 61 [2021-11-20 07:34:44,654 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-11-20 07:34:44,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 32 [2021-11-20 07:34:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:34:44,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:34:45,406 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:34:45,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2021-11-20 07:34:50,390 INFO L354 Elim1Store]: treesize reduction 39, result has 72.5 percent of original size [2021-11-20 07:34:50,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2790 treesize of output 2632 [2021-11-20 07:34:51,005 INFO L354 Elim1Store]: treesize reduction 154, result has 56.6 percent of original size [2021-11-20 07:34:51,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 14464 treesize of output 13300 [2021-11-20 07:34:51,955 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-20 07:34:51,956 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:34:51,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2021-11-20 07:34:51,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639193648] [2021-11-20 07:34:51,956 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 07:34:51,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 07:34:51,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:51,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 07:34:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2710, Unknown=1, NotChecked=0, Total=2862 [2021-11-20 07:34:51,958 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:53,492 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2021-11-20 07:34:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 07:34:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2021-11-20 07:34:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:53,495 INFO L225 Difference]: With dead ends: 164 [2021-11-20 07:34:53,495 INFO L226 Difference]: Without dead ends: 164 [2021-11-20 07:34:53,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=334, Invalid=4087, Unknown=1, NotChecked=0, Total=4422 [2021-11-20 07:34:53,498 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 230 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:53,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 820 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 07:34:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-20 07:34:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. [2021-11-20 07:34:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 130 states have internal predecessors, (162), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2021-11-20 07:34:53,505 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 41 [2021-11-20 07:34:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:53,505 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2021-11-20 07:34:53,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2021-11-20 07:34:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 07:34:53,507 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:53,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:53,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:53,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:53,725 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:53,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1471699153, now seen corresponding path program 1 times [2021-11-20 07:34:53,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:53,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977934988] [2021-11-20 07:34:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:53,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:53,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:53,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977934988] [2021-11-20 07:34:53,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977934988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:34:53,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:34:53,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:34:53,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183136193] [2021-11-20 07:34:53,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:34:53,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:34:53,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:34:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:34:53,802 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:53,903 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2021-11-20 07:34:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:34:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2021-11-20 07:34:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:53,905 INFO L225 Difference]: With dead ends: 132 [2021-11-20 07:34:53,905 INFO L226 Difference]: Without dead ends: 132 [2021-11-20 07:34:53,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:34:53,906 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:53,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 105 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-20 07:34:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-11-20 07:34:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 128 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2021-11-20 07:34:53,913 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 41 [2021-11-20 07:34:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:53,913 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2021-11-20 07:34:53,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:34:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2021-11-20 07:34:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 07:34:53,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:53,915 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:53,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-20 07:34:53,915 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:53,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1471699154, now seen corresponding path program 1 times [2021-11-20 07:34:53,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:53,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596541831] [2021-11-20 07:34:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:53,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:53,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:54,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:54,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596541831] [2021-11-20 07:34:54,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596541831] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:54,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078524868] [2021-11-20 07:34:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:54,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:54,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:54,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:54,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 07:34:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:54,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 07:34:54,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:54,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:34:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:54,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078524868] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:34:54,427 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:34:54,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-11-20 07:34:54,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280125864] [2021-11-20 07:34:54,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:34:54,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 07:34:54,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 07:34:54,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:34:54,429 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 07:34:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:34:54,513 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2021-11-20 07:34:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:34:54,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-11-20 07:34:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:34:54,515 INFO L225 Difference]: With dead ends: 155 [2021-11-20 07:34:54,515 INFO L226 Difference]: Without dead ends: 155 [2021-11-20 07:34:54,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:34:54,516 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 229 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:34:54,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 209 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:34:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-20 07:34:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2021-11-20 07:34:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 143 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:34:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 186 transitions. [2021-11-20 07:34:54,522 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 186 transitions. Word has length 41 [2021-11-20 07:34:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:34:54,522 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 186 transitions. [2021-11-20 07:34:54,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 07:34:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2021-11-20 07:34:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-20 07:34:54,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:34:54,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:34:54,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 07:34:54,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-20 07:34:54,725 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:34:54,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:34:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1471699143, now seen corresponding path program 1 times [2021-11-20 07:34:54,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:34:54,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779811168] [2021-11-20 07:34:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:54,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:34:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:34:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:34:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:34:54,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:34:54,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779811168] [2021-11-20 07:34:54,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779811168] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:34:54,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397106409] [2021-11-20 07:34:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:34:54,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:34:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:34:54,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:34:54,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 07:34:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:34:54,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 55 conjunts are in the unsatisfiable core [2021-11-20 07:34:54,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:34:54,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 07:34:55,128 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 07:34:55,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 07:34:55,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:34:55,261 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 07:34:55,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2021-11-20 07:34:55,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2021-11-20 07:34:55,598 INFO L354 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2021-11-20 07:34:55,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 29 [2021-11-20 07:34:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:34:55,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:34:55,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2021-11-20 07:34:56,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0))))) is different from false [2021-11-20 07:34:57,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2021-11-20 07:34:58,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse0)))))) is different from false [2021-11-20 07:34:58,833 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:34:58,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 438 treesize of output 380 [2021-11-20 07:34:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-20 07:34:59,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397106409] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:34:59,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:34:59,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 22, 21] total 43 [2021-11-20 07:34:59,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088348655] [2021-11-20 07:34:59,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:34:59,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-20 07:34:59,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:34:59,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-20 07:34:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1455, Unknown=3, NotChecked=234, Total=1806 [2021-11-20 07:34:59,528 INFO L87 Difference]: Start difference. First operand 147 states and 186 transitions. Second operand has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 36 states have internal predecessors, (88), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 07:35:00,850 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-11-20 07:35:02,077 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2021-11-20 07:35:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:35:02,519 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2021-11-20 07:35:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 07:35:02,519 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 36 states have internal predecessors, (88), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2021-11-20 07:35:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:35:02,521 INFO L225 Difference]: With dead ends: 126 [2021-11-20 07:35:02,521 INFO L226 Difference]: Without dead ends: 126 [2021-11-20 07:35:02,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=175, Invalid=2002, Unknown=5, NotChecked=470, Total=2652 [2021-11-20 07:35:02,523 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 134 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:35:02,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 651 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 591 Invalid, 0 Unknown, 329 Unchecked, 0.3s Time] [2021-11-20 07:35:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-20 07:35:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-11-20 07:35:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 122 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:35:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2021-11-20 07:35:02,538 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 41 [2021-11-20 07:35:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:35:02,538 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2021-11-20 07:35:02,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 36 states have internal predecessors, (88), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 07:35:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2021-11-20 07:35:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 07:35:02,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:35:02,540 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:35:02,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 07:35:02,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-20 07:35:02,767 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:35:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:35:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash 408363075, now seen corresponding path program 1 times [2021-11-20 07:35:02,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:35:02,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376887379] [2021-11-20 07:35:02,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:35:02,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:35:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:35:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:35:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:35:03,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:35:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:35:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:35:03,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:35:03,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376887379] [2021-11-20 07:35:03,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376887379] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:35:03,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220614583] [2021-11-20 07:35:03,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:35:03,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:35:03,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:35:03,203 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:35:03,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 07:35:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:35:03,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-20 07:35:03,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:35:03,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-11-20 07:35:03,832 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-11-20 07:35:03,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 31 [2021-11-20 07:35:03,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-20 07:35:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:35:03,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:35:05,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:07,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:09,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:11,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:12,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:14,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem8#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:16,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.offset|))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:16,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-11-20 07:35:18,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int) (v_arrayElimCell_64 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 .cse0))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:19,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int) (v_arrayElimCell_64 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 .cse0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) is different from false [2021-11-20 07:35:20,006 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 07:35:20,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 43 [2021-11-20 07:35:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-11-20 07:35:20,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220614583] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:35:20,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:35:20,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 33 [2021-11-20 07:35:20,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457637090] [2021-11-20 07:35:20,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:35:20,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-20 07:35:20,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:35:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 07:35:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=530, Unknown=9, NotChecked=486, Total=1122 [2021-11-20 07:35:20,145 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:35:22,290 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int) (v_arrayElimCell_64 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 .cse0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-20 07:35:24,292 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int) (v_arrayElimCell_64 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 .cse0))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:26,297 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.offset|))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= .cse0 0) (= |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.offset|))) is different from false [2021-11-20 07:35:28,245 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem8#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_#t~mem8#1.offset| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) .cse0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= .cse0 0))) is different from false [2021-11-20 07:35:30,248 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) .cse0) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|) (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= .cse0 0))) is different from false [2021-11-20 07:35:32,121 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) (= .cse0 0) (= |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.base|) .cse0)))) is different from false [2021-11-20 07:35:34,023 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) .cse0) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= .cse0 0))) is different from false [2021-11-20 07:35:36,026 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|) (= |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.offset| .cse0)))) (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:38,029 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (exists ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| .cse0) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2021-11-20 07:35:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:35:38,081 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2021-11-20 07:35:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 07:35:38,082 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-11-20 07:35:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:35:38,083 INFO L225 Difference]: With dead ends: 128 [2021-11-20 07:35:38,083 INFO L226 Difference]: Without dead ends: 128 [2021-11-20 07:35:38,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=131, Invalid=679, Unknown=18, NotChecked=1242, Total=2070 [2021-11-20 07:35:38,084 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:35:38,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 669 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 299 Unchecked, 0.1s Time] [2021-11-20 07:35:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-20 07:35:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-11-20 07:35:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.4) internal successors, (154), 124 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 07:35:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2021-11-20 07:35:38,090 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 46 [2021-11-20 07:35:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:35:38,090 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2021-11-20 07:35:38,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 07:35:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2021-11-20 07:35:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 07:35:38,091 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:35:38,092 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:35:38,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 07:35:38,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:35:38,311 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-20 07:35:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:35:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash 408415690, now seen corresponding path program 2 times [2021-11-20 07:35:38,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:35:38,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416747264] [2021-11-20 07:35:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:35:38,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:35:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:35:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:35:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:35:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:35:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:35:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:35:38,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:35:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416747264] [2021-11-20 07:35:38,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416747264] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:35:38,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088524340] [2021-11-20 07:35:38,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 07:35:38,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:35:38,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:35:38,895 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:35:38,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c36658-a108-481d-aa37-ca7bb4760d45/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 07:35:39,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 07:35:39,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 07:35:39,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-20 07:35:39,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:35:39,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-20 07:35:39,413 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 07:35:39,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-20 07:35:39,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:35:39,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 07:35:39,733 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-20 07:35:39,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2021-11-20 07:35:39,747 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 07:35:39,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2021-11-20 07:35:40,677 INFO L354 Elim1Store]: treesize reduction 94, result has 3.1 percent of original size [2021-11-20 07:35:40,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 74 [2021-11-20 07:35:40,938 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-20 07:35:40,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2021-11-20 07:35:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:35:40,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:35:42,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))) 1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)))))) is different from false [2021-11-20 07:35:44,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse1)) (= (select |c_#valid| (select (select .cse2 (select (select .cse2 .cse0) .cse1)) (select (select .cse3 .cse0) .cse1))) 1))))) is different from false [2021-11-20 07:35:45,519 INFO L354 Elim1Store]: treesize reduction 3069, result has 38.5 percent of original size [2021-11-20 07:35:45,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 18 new quantified variables, introduced 78 case distinctions, treesize of input 31903 treesize of output 27468 [2021-11-20 07:35:46,639 INFO L354 Elim1Store]: treesize reduction 165, result has 53.5 percent of original size [2021-11-20 07:35:46,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 185631 treesize of output 167048 [2021-11-20 07:35:59,931 WARN L227 SmtUtils]: Spent 13.29s on a formula simplification. DAG size of input: 1427 DAG size of output: 1404 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 07:36:03,273 INFO L354 Elim1Store]: treesize reduction 5, result has 98.9 percent of original size [2021-11-20 07:36:03,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 150805 treesize of output 151100