./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0 --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 c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 14:36:20,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 14:36:20,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 14:36:20,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 14:36:20,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 14:36:20,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 14:36:20,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 14:36:20,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 14:36:20,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 14:36:20,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 14:36:20,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 14:36:20,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 14:36:20,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 14:36:20,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 14:36:20,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 14:36:20,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 14:36:20,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 14:36:20,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 14:36:20,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 14:36:20,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 14:36:20,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 14:36:20,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 14:36:20,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 14:36:20,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 14:36:20,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 14:36:20,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 14:36:20,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 14:36:20,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 14:36:20,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 14:36:20,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 14:36:20,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 14:36:20,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 14:36:20,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 14:36:20,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 14:36:20,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 14:36:20,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 14:36:20,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 14:36:20,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 14:36:20,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 14:36:20,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 14:36:20,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 14:36:20,760 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-22 14:36:20,787 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 14:36:20,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 14:36:20,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 14:36:20,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 14:36:20,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 14:36:20,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 14:36:20,790 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 14:36:20,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 14:36:20,790 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 14:36:20,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-22 14:36:20,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 14:36:20,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 14:36:20,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 14:36:20,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-22 14:36:20,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-22 14:36:20,792 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-22 14:36:20,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 14:36:20,793 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 14:36:20,793 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 14:36:20,793 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 14:36:20,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 14:36:20,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 14:36:20,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 14:36:20,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:36:20,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 14:36:20,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 14:36:20,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 14:36:20,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 14:36:20,796 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 14:36:20,796 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_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/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_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2021-11-22 14:36:21,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 14:36:21,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 14:36:21,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 14:36:21,175 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 14:36:21,176 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 14:36:21,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-11-22 14:36:21,265 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/data/1494d689f/9284625968994b04b5b10b4b97878afd/FLAGd8942f863 [2021-11-22 14:36:21,965 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 14:36:21,966 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-11-22 14:36:22,001 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/data/1494d689f/9284625968994b04b5b10b4b97878afd/FLAGd8942f863 [2021-11-22 14:36:22,232 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/data/1494d689f/9284625968994b04b5b10b4b97878afd [2021-11-22 14:36:22,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 14:36:22,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 14:36:22,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 14:36:22,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 14:36:22,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 14:36:22,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:22,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324f2208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22, skipping insertion in model container [2021-11-22 14:36:22,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:22,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 14:36:22,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 14:36:22,778 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_ed10d561-8b06-4d5a-8205-2f0efec4a492/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-11-22 14:36:22,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:36:22,798 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 14:36:22,857 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_ed10d561-8b06-4d5a-8205-2f0efec4a492/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-11-22 14:36:22,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:36:22,896 INFO L208 MainTranslator]: Completed translation [2021-11-22 14:36:22,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22 WrapperNode [2021-11-22 14:36:22,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 14:36:22,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 14:36:22,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 14:36:22,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 14:36:22,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:22,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:22,962 INFO L137 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 94 [2021-11-22 14:36:22,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 14:36:22,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 14:36:22,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 14:36:22,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 14:36:22,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:22,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:22,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:22,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:23,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:23,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:23,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:23,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 14:36:23,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 14:36:23,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 14:36:23,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 14:36:23,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (1/1) ... [2021-11-22 14:36:23,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:36:23,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:36:23,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 14:36:23,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 14:36:23,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 14:36:23,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 14:36:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 14:36:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 14:36:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 14:36:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 14:36:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 14:36:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 14:36:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 14:36:23,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 14:36:23,275 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 14:36:23,277 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 14:36:23,633 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 14:36:23,641 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 14:36:23,641 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-22 14:36:23,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:36:23 BoogieIcfgContainer [2021-11-22 14:36:23,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 14:36:23,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 14:36:23,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 14:36:23,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 14:36:23,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:36:22" (1/3) ... [2021-11-22 14:36:23,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d0a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:36:23, skipping insertion in model container [2021-11-22 14:36:23,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:36:22" (2/3) ... [2021-11-22 14:36:23,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d0a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:36:23, skipping insertion in model container [2021-11-22 14:36:23,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:36:23" (3/3) ... [2021-11-22 14:36:23,659 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2021-11-22 14:36:23,666 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 14:36:23,667 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-11-22 14:36:23,747 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 14:36:23,763 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-22 14:36:23,764 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-11-22 14:36:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 2.0) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-22 14:36:23,811 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:23,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-22 14:36:23,812 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2021-11-22 14:36:23,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:23,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678738025] [2021-11-22 14:36:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:23,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:24,147 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-22 14:36:24,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:24,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678738025] [2021-11-22 14:36:24,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678738025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:24,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:24,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:36:24,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243741144] [2021-11-22 14:36:24,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:24,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:36:24,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:24,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:36:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:36:24,207 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 2.0) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:24,384 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2021-11-22 14:36:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:36:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-22 14:36:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:24,400 INFO L225 Difference]: With dead ends: 74 [2021-11-22 14:36:24,400 INFO L226 Difference]: Without dead ends: 70 [2021-11-22 14:36:24,402 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-22 14:36:24,408 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 52 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:24,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:36:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-22 14:36:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2021-11-22 14:36:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-11-22 14:36:24,456 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2021-11-22 14:36:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:24,456 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-11-22 14:36:24,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-11-22 14:36:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-22 14:36:24,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:24,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-22 14:36:24,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 14:36:24,458 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:24,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2021-11-22 14:36:24,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:24,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957487472] [2021-11-22 14:36:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:24,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:24,521 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-22 14:36:24,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:24,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957487472] [2021-11-22 14:36:24,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957487472] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:24,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:24,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:36:24,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840665648] [2021-11-22 14:36:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:24,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:36:24,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:36:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:36:24,529 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:24,618 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-11-22 14:36:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:36:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-22 14:36:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:24,623 INFO L225 Difference]: With dead ends: 51 [2021-11-22 14:36:24,624 INFO L226 Difference]: Without dead ends: 51 [2021-11-22 14:36:24,624 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-22 14:36:24,627 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:24,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:36:24,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-22 14:36:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-22 14:36:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-11-22 14:36:24,636 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2021-11-22 14:36:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:24,637 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-11-22 14:36:24,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-11-22 14:36:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-22 14:36:24,642 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:24,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:24,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 14:36:24,647 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2098000980, now seen corresponding path program 1 times [2021-11-22 14:36:24,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:24,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105311594] [2021-11-22 14:36:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:24,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:24,745 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-22 14:36:24,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:24,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105311594] [2021-11-22 14:36:24,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105311594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:24,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:24,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:36:24,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968386199] [2021-11-22 14:36:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:24,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:36:24,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:36:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:36:24,748 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:24,862 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-11-22 14:36:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:36:24,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-22 14:36:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:24,868 INFO L225 Difference]: With dead ends: 82 [2021-11-22 14:36:24,868 INFO L226 Difference]: Without dead ends: 82 [2021-11-22 14:36:24,869 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-22 14:36:24,870 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:24,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:36:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-22 14:36:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2021-11-22 14:36:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-11-22 14:36:24,884 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2021-11-22 14:36:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:24,885 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-11-22 14:36:24,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-11-22 14:36:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-22 14:36:24,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:24,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:24,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 14:36:24,887 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2098000981, now seen corresponding path program 1 times [2021-11-22 14:36:24,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319148709] [2021-11-22 14:36:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:24,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:24,970 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-22 14:36:24,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:24,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319148709] [2021-11-22 14:36:24,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319148709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:24,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:24,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:36:24,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321859140] [2021-11-22 14:36:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:24,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:36:24,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:36:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:36:24,973 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:25,053 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2021-11-22 14:36:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:36:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-22 14:36:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:25,061 INFO L225 Difference]: With dead ends: 84 [2021-11-22 14:36:25,061 INFO L226 Difference]: Without dead ends: 84 [2021-11-22 14:36:25,062 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-22 14:36:25,064 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:25,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:36:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-22 14:36:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2021-11-22 14:36:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2021-11-22 14:36:25,073 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2021-11-22 14:36:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:25,073 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-11-22 14:36:25,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2021-11-22 14:36:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 14:36:25,081 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:25,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:25,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 14:36:25,082 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:25,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1837803479, now seen corresponding path program 1 times [2021-11-22 14:36:25,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:25,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369123850] [2021-11-22 14:36:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:25,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:25,192 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-22 14:36:25,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:25,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369123850] [2021-11-22 14:36:25,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369123850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:25,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:25,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:36:25,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316869211] [2021-11-22 14:36:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:25,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:36:25,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:36:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:36:25,197 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:25,495 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2021-11-22 14:36:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 14:36:25,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-22 14:36:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:25,498 INFO L225 Difference]: With dead ends: 92 [2021-11-22 14:36:25,498 INFO L226 Difference]: Without dead ends: 92 [2021-11-22 14:36:25,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:36:25,501 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 210 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:25,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 77 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:36:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-22 14:36:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2021-11-22 14:36:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2021-11-22 14:36:25,513 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2021-11-22 14:36:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:25,514 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2021-11-22 14:36:25,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2021-11-22 14:36:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 14:36:25,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:25,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:25,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 14:36:25,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1837803480, now seen corresponding path program 1 times [2021-11-22 14:36:25,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:25,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857330822] [2021-11-22 14:36:25,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:25,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:25,564 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-22 14:36:25,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857330822] [2021-11-22 14:36:25,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857330822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:25,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:25,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:36:25,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298731614] [2021-11-22 14:36:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:25,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:36:25,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:36:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:36:25,568 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:25,577 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2021-11-22 14:36:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:36:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-22 14:36:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:25,579 INFO L225 Difference]: With dead ends: 48 [2021-11-22 14:36:25,579 INFO L226 Difference]: Without dead ends: 48 [2021-11-22 14:36:25,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 14:36:25,581 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:25,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:36:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-22 14:36:25,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2021-11-22 14:36:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2021-11-22 14:36:25,588 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 11 [2021-11-22 14:36:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:25,589 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2021-11-22 14:36:25,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2021-11-22 14:36:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 14:36:25,590 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:25,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:25,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 14:36:25,591 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash -25179927, now seen corresponding path program 1 times [2021-11-22 14:36:25,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:25,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058746607] [2021-11-22 14:36:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:25,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:36:25,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:25,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058746607] [2021-11-22 14:36:25,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058746607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:25,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:25,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:36:25,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520248688] [2021-11-22 14:36:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:25,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:36:25,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:36:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:36:25,676 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:25,840 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2021-11-22 14:36:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:36:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-22 14:36:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:25,841 INFO L225 Difference]: With dead ends: 64 [2021-11-22 14:36:25,842 INFO L226 Difference]: Without dead ends: 64 [2021-11-22 14:36:25,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:36:25,844 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:25,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:36:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-22 14:36:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2021-11-22 14:36:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-11-22 14:36:25,850 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2021-11-22 14:36:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:25,850 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-11-22 14:36:25,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-11-22 14:36:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 14:36:25,851 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:25,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:25,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 14:36:25,852 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:25,852 INFO L85 PathProgramCache]: Analyzing trace with hash -25179926, now seen corresponding path program 1 times [2021-11-22 14:36:25,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:25,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516976495] [2021-11-22 14:36:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:25,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:36:25,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:25,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516976495] [2021-11-22 14:36:25,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516976495] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:36:25,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879389951] [2021-11-22 14:36:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:25,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:36:25,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:36:25,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:36:25,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 14:36:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:26,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 14:36:26,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:36:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:36:26,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:36:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:36:26,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879389951] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:36:26,217 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:36:26,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-11-22 14:36:26,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656294698] [2021-11-22 14:36:26,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:36:26,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:36:26,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:26,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:36:26,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:36:26,220 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:26,241 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-11-22 14:36:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:36:26,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-22 14:36:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:26,242 INFO L225 Difference]: With dead ends: 60 [2021-11-22 14:36:26,242 INFO L226 Difference]: Without dead ends: 60 [2021-11-22 14:36:26,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:36:26,244 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:26,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 123 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:36:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-22 14:36:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-22 14:36:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-11-22 14:36:26,251 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2021-11-22 14:36:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:26,251 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-11-22 14:36:26,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-11-22 14:36:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-22 14:36:26,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:26,253 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:26,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 14:36:26,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-22 14:36:26,475 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash 862539352, now seen corresponding path program 2 times [2021-11-22 14:36:26,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112038776] [2021-11-22 14:36:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:26,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-22 14:36:26,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:26,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112038776] [2021-11-22 14:36:26,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112038776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:36:26,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:36:26,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:36:26,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417027143] [2021-11-22 14:36:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:36:26,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:36:26,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:36:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:36:26,666 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:26,854 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-11-22 14:36:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:36:26,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-22 14:36:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:26,856 INFO L225 Difference]: With dead ends: 66 [2021-11-22 14:36:26,856 INFO L226 Difference]: Without dead ends: 66 [2021-11-22 14:36:26,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:36:26,857 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:26,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:36:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-22 14:36:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-11-22 14:36:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-11-22 14:36:26,865 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2021-11-22 14:36:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:26,865 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-11-22 14:36:26,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-11-22 14:36:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 14:36:26,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:26,867 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:26,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 14:36:26,868 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -28370902, now seen corresponding path program 1 times [2021-11-22 14:36:26,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:26,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330630214] [2021-11-22 14:36:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:26,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-22 14:36:27,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:27,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330630214] [2021-11-22 14:36:27,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330630214] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:36:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834896805] [2021-11-22 14:36:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:27,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:36:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:36:27,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:36:27,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 14:36:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:27,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-22 14:36:27,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:36:27,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-22 14:36:27,882 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-22 14:36:27,883 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 28 treesize of output 16 [2021-11-22 14:36:28,004 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 22 treesize of output 10 [2021-11-22 14:36:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-22 14:36:28,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:36:29,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2021-11-22 14:36:31,071 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)))) is different from false [2021-11-22 14:36:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 7 not checked. [2021-11-22 14:36:31,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834896805] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:36:31,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:36:31,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-11-22 14:36:31,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342682283] [2021-11-22 14:36:31,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:36:31,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-22 14:36:31,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-22 14:36:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2021-11-22 14:36:31,343 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:32,045 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-22 14:36:32,580 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2021-11-22 14:36:33,133 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2021-11-22 14:36:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:36:33,457 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-11-22 14:36:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 14:36:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-22 14:36:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:36:33,459 INFO L225 Difference]: With dead ends: 63 [2021-11-22 14:36:33,460 INFO L226 Difference]: Without dead ends: 63 [2021-11-22 14:36:33,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=129, Invalid=698, Unknown=5, NotChecked=290, Total=1122 [2021-11-22 14:36:33,461 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:36:33,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 419 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 209 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2021-11-22 14:36:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-22 14:36:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-22 14:36:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-11-22 14:36:33,482 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2021-11-22 14:36:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:36:33,482 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-11-22 14:36:33,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:36:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-11-22 14:36:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 14:36:33,489 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:36:33,489 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:36:33,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 14:36:33,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:36:33,690 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:36:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:36:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1809332025, now seen corresponding path program 1 times [2021-11-22 14:36:33,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:36:33,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072639816] [2021-11-22 14:36:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:33,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:36:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 14:36:34,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:36:34,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072639816] [2021-11-22 14:36:34,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072639816] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:36:34,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90334198] [2021-11-22 14:36:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:36:34,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:36:34,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:36:34,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:36:34,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 14:36:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:36:34,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-22 14:36:34,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:36:34,275 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-22 14:36:34,325 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 14:36:34,326 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-22 14:36:34,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2021-11-22 14:36:34,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:36:34,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-22 14:36:34,589 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-22 14:36:34,589 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 21 treesize of output 24 [2021-11-22 14:36:34,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:36:34,871 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 14:36:34,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2021-11-22 14:36:34,908 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:36:34,909 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 34 treesize of output 25 [2021-11-22 14:36:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 14:36:34,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:36:36,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) is different from false [2021-11-22 14:36:37,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2021-11-22 14:36:39,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_3 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (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| 4) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2021-11-22 14:36:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-11-22 14:36:39,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90334198] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:36:39,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:36:39,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 28 [2021-11-22 14:36:39,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226655411] [2021-11-22 14:36:39,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:36:39,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-22 14:36:39,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:36:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-22 14:36:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=567, Unknown=3, NotChecked=150, Total=812 [2021-11-22 14:36:39,454 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:01,557 WARN L227 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 44 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 14:37:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:37:01,710 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-11-22 14:37:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 14:37:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-22 14:37:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:37:01,712 INFO L225 Difference]: With dead ends: 72 [2021-11-22 14:37:01,712 INFO L226 Difference]: Without dead ends: 72 [2021-11-22 14:37:01,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=174, Invalid=825, Unknown=5, NotChecked=186, Total=1190 [2021-11-22 14:37:01,714 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 14:37:01,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 255 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 216 Unchecked, 0.3s Time] [2021-11-22 14:37:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-22 14:37:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2021-11-22 14:37:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-11-22 14:37:01,722 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2021-11-22 14:37:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:37:01,723 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-11-22 14:37:01,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-11-22 14:37:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 14:37:01,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:37:01,725 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:37:01,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 14:37:01,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:01,938 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:37:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:37:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1809332024, now seen corresponding path program 1 times [2021-11-22 14:37:01,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:37:01,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085850805] [2021-11-22 14:37:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:01,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:37:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 14:37:02,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:37:02,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085850805] [2021-11-22 14:37:02,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085850805] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:37:02,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261431017] [2021-11-22 14:37:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:02,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:37:02,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:37:02,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 14:37:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:02,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-22 14:37:02,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:37:03,061 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 14:37:03,062 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 20 [2021-11-22 14:37:03,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-11-22 14:37:03,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2021-11-22 14:37:03,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:37:03,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-22 14:37:03,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:37:03,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-22 14:37:03,392 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-22 14:37:03,393 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 39 treesize of output 38 [2021-11-22 14:37:03,409 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-22 14:37:03,410 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 35 treesize of output 38 [2021-11-22 14:37:04,518 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-22 14:37:04,518 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 86 [2021-11-22 14:37:04,554 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-11-22 14:37:04,555 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 55 [2021-11-22 14:37:04,688 INFO L354 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2021-11-22 14:37:04,689 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 88 treesize of output 70 [2021-11-22 14:37:04,704 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-22 14:37:04,705 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 58 treesize of output 44 [2021-11-22 14:37:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 14:37:04,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:37:07,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0))))) is different from false [2021-11-22 14:37:09,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-22 14:37:11,805 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_DerPreprocessor_7)))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_DerPreprocessor_6)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1)))))) is different from false [2021-11-22 14:37:16,390 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 34 treesize of output 30 [2021-11-22 14:37:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-11-22 14:37:16,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261431017] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:37:16,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:37:16,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2021-11-22 14:37:16,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612924322] [2021-11-22 14:37:16,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:37:16,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-22 14:37:16,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:37:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-22 14:37:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1123, Unknown=3, NotChecked=210, Total=1482 [2021-11-22 14:37:16,497 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:18,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (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|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (= .cse8 8)) (.cse0 (select |c_#length| .cse10)) (.cse9 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (<= 8 .cse0) .cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= .cse2 0) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse6 v_DerPreprocessor_7)))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse6 v_DerPreprocessor_6)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse3 8) (select |c_#length| .cse4)) (<= 0 (+ .cse3 4))) (and (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse4)))))) (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse8) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (or .cse9 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse9 .cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse9 (= .cse0 8) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse10)) (or .cse9 (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-22 14:37:20,872 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (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|))) (let ((.cse0 (select |c_#length| .cse5)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= .cse1 0) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse2 8) (select |c_#length| .cse3)) (<= 0 (+ .cse2 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3) (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (or .cse4 (= .cse0 8) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse5)) (or .cse4 (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-22 14:37:22,877 WARN L838 $PredicateComparison]: unable to prove that (and (<= 8 (select |c_#length| (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|))) (let ((.cse0 (select (select (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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= 8 (select |c_#length| .cse0)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse2))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1))))) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-11-22 14:37:24,939 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (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|))) (let ((.cse7 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#length| .cse9)) (.cse8 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= .cse1 0) (forall ((v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse5 v_DerPreprocessor_7)))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse5 v_DerPreprocessor_6)))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse2 8) (select |c_#length| .cse3)) (<= 0 (+ .cse2 4))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3)))))) (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse7) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (or .cse8 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse8 (= .cse7 8) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse8 (= .cse0 8) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse9)) (or .cse8 (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-11-22 14:37:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:37:25,492 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2021-11-22 14:37:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 14:37:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-22 14:37:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:37:25,494 INFO L225 Difference]: With dead ends: 93 [2021-11-22 14:37:25,494 INFO L226 Difference]: Without dead ends: 93 [2021-11-22 14:37:25,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=245, Invalid=1846, Unknown=7, NotChecked=658, Total=2756 [2021-11-22 14:37:25,497 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 97 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 14:37:25,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 252 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 432 Invalid, 0 Unknown, 216 Unchecked, 0.5s Time] [2021-11-22 14:37:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-22 14:37:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2021-11-22 14:37:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2021-11-22 14:37:25,505 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 37 [2021-11-22 14:37:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:37:25,506 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2021-11-22 14:37:25,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:37:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-11-22 14:37:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 14:37:25,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:37:25,508 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:37:25,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 14:37:25,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-22 14:37:25,720 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-11-22 14:37:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:37:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash 693679770, now seen corresponding path program 1 times [2021-11-22 14:37:25,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:37:25,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060347043] [2021-11-22 14:37:25,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:25,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:37:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 14:37:26,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:37:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060347043] [2021-11-22 14:37:26,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060347043] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:37:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397544788] [2021-11-22 14:37:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:37:26,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:37:26,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:37:26,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:37:26,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed10d561-8b06-4d5a-8205-2f0efec4a492/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 14:37:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:37:26,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-22 14:37:26,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:37:27,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-22 14:37:27,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-11-22 14:37:27,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 30 [2021-11-22 14:37:27,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-11-22 14:37:27,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:37:27,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-22 14:37:27,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:37:27,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-11-22 14:37:27,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:37:27,381 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-22 14:37:27,382 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 25 treesize of output 24 [2021-11-22 14:37:27,591 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-22 14:37:27,592 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 65 treesize of output 68 [2021-11-22 14:37:27,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:37:27,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:37:27,602 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 14:37:27,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2021-11-22 14:37:27,620 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-22 14:37:27,620 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 53 treesize of output 52 [2021-11-22 14:37:28,799 INFO L354 Elim1Store]: treesize reduction 122, result has 8.3 percent of original size [2021-11-22 14:37:28,799 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 124 [2021-11-22 14:37:28,840 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-22 14:37:28,840 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 87 [2021-11-22 14:37:28,870 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-11-22 14:37:28,871 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 56 [2021-11-22 14:37:29,077 INFO L354 Elim1Store]: treesize reduction 29, result has 29.3 percent of original size [2021-11-22 14:37:29,078 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 61 [2021-11-22 14:37:29,093 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-22 14:37:29,094 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 52 treesize of output 38 [2021-11-22 14:37:29,269 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-22 14:37:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 14:37:29,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:37:32,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_10 Int) (|ULTIMATE.start_main_~data_new~0#1| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_10)))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 |ULTIMATE.start_main_~data_new~0#1|))) .cse2) (+ .cse3 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2)))))) is different from false [2021-11-22 14:37:34,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_10 Int) (|ULTIMATE.start_main_~data_new~0#1| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_10)))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 |ULTIMATE.start_main_~data_new~0#1|))) .cse2) (+ .cse3 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2)))))) is different from false [2021-11-22 14:37:36,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_DerPreprocessor_10 Int) (|ULTIMATE.start_main_~data_new~0#1| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (store (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_11)))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_12)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |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|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_sll_circular_create_~data#1|)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_DerPreprocessor_10))))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 |ULTIMATE.start_main_~data_new~0#1|))) .cse3) (+ .cse4 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse4)))))) is different from false [2021-11-22 14:37:36,473 INFO L354 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2021-11-22 14:37:36,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 237 [2021-11-22 14:37:36,496 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:36,496 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 333 treesize of output 279 [2021-11-22 14:37:36,582 INFO L354 Elim1Store]: treesize reduction 87, result has 34.1 percent of original size [2021-11-22 14:37:36,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 235 [2021-11-22 14:37:36,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:36,607 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 227 [2021-11-22 14:37:36,680 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 6 treesize of output 4 [2021-11-22 14:37:36,862 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 150 treesize of output 126 [2021-11-22 14:37:38,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:37:38,171 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:37:38,171 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 271 treesize of output 245