./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8 --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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:59:47,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:59:47,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:59:47,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:59:47,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:59:47,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:59:47,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:59:47,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:59:47,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:59:47,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:59:47,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:59:47,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:59:47,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:59:47,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:59:47,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:59:47,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:59:47,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:59:47,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:59:47,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:59:47,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:59:47,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:59:47,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:59:47,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:59:47,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:59:47,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:59:47,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:59:47,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:59:47,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:59:47,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:59:47,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:59:47,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:59:47,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:59:47,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:59:47,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:59:47,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:59:47,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:59:47,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:59:47,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:59:47,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:59:47,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:59:47,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:59:47,907 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:59:47,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:59:47,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:59:47,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:59:47,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:59:47,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:59:47,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:59:47,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:59:47,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:59:47,962 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:59:47,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:59:47,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:59:47,963 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:59:47,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:59:47,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:59:47,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:59:47,964 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:59:47,964 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:59:47,965 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:59:47,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:59:47,965 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:59:47,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:59:47,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:59:47,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:59:47,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:59:47,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:59:47,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:59:47,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:59:47,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:59:47,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:59:47,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:59:47,969 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_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/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_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2022-11-16 11:59:48,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:59:48,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:59:48,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:59:48,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:59:48,305 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:59:48,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-11-16 11:59:48,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/data/02cc9dae7/d8a6031b8c814af7a62abb34f2e734dd/FLAG38cb23800 [2022-11-16 11:59:49,052 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:59:49,053 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-11-16 11:59:49,065 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/data/02cc9dae7/d8a6031b8c814af7a62abb34f2e734dd/FLAG38cb23800 [2022-11-16 11:59:49,329 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/data/02cc9dae7/d8a6031b8c814af7a62abb34f2e734dd [2022-11-16 11:59:49,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:59:49,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:59:49,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:59:49,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:59:49,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:59:49,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f385cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49, skipping insertion in model container [2022-11-16 11:59:49,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:59:49,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:59:49,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:59:49,798 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:59:49,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:59:49,868 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:59:49,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49 WrapperNode [2022-11-16 11:59:49,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:59:49,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:59:49,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:59:49,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:59:49,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,916 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2022-11-16 11:59:49,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:59:49,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:59:49,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:59:49,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:59:49,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,947 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:59:49,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:59:49,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:59:49,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:59:49,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (1/1) ... [2022-11-16 11:59:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:59:49,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:59:49,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:59:50,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:59:50,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:59:50,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:59:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:59:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:59:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:59:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:59:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:59:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:59:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:59:50,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:59:50,200 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:59:50,202 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:59:50,938 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:59:50,951 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:59:50,951 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:59:50,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:59:50 BoogieIcfgContainer [2022-11-16 11:59:50,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:59:50,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:59:50,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:59:50,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:59:50,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:59:49" (1/3) ... [2022-11-16 11:59:50,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3572b014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:50, skipping insertion in model container [2022-11-16 11:59:50,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:49" (2/3) ... [2022-11-16 11:59:50,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3572b014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:50, skipping insertion in model container [2022-11-16 11:59:50,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:59:50" (3/3) ... [2022-11-16 11:59:50,971 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2022-11-16 11:59:51,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:59:51,002 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-11-16 11:59:51,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:59:51,119 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67c286d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:59:51,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-11-16 11:59:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 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) [2022-11-16 11:59:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:59:51,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:51,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:59:51,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2022-11-16 11:59:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:51,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318940669] [2022-11-16 11:59:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318940669] [2022-11-16 11:59:51,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318940669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:51,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:51,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840517745] [2022-11-16 11:59:51,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:51,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:59:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:59:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:59:51,431 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-11-16 11:59:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:51,478 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-16 11:59:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:59:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-16 11:59:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:51,500 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:59:51,501 INFO L226 Difference]: Without dead ends: 149 [2022-11-16 11:59:51,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:59:51,509 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:51,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:59:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-16 11:59:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-16 11:59:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-11-16 11:59:51,604 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2022-11-16 11:59:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:51,604 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-11-16 11:59:51,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-11-16 11:59:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-11-16 11:59:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:59:51,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:51,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:51,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:59:51,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2022-11-16 11:59:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:51,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798606179] [2022-11-16 11:59:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:51,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798606179] [2022-11-16 11:59:51,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798606179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:51,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:51,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:51,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220844423] [2022-11-16 11:59:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:51,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:51,675 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:51,919 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-11-16 11:59:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-11-16 11:59:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:51,925 INFO L225 Difference]: With dead ends: 196 [2022-11-16 11:59:51,927 INFO L226 Difference]: Without dead ends: 195 [2022-11-16 11:59:51,927 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:59:51,930 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:51,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-16 11:59:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2022-11-16 11:59:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 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) [2022-11-16 11:59:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2022-11-16 11:59:51,957 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2022-11-16 11:59:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:51,957 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2022-11-16 11:59:51,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2022-11-16 11:59:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:59:51,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:51,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:51,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:59:51,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:51,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2022-11-16 11:59:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:51,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075388415] [2022-11-16 11:59:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:52,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075388415] [2022-11-16 11:59:52,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075388415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:52,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:52,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:59:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435596608] [2022-11-16 11:59:52,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:52,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:52,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:52,036 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:52,108 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-11-16 11:59:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-11-16 11:59:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:52,110 INFO L225 Difference]: With dead ends: 173 [2022-11-16 11:59:52,110 INFO L226 Difference]: Without dead ends: 172 [2022-11-16 11:59:52,110 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:59:52,112 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:52,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:59:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-16 11:59:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-11-16 11:59:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 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) [2022-11-16 11:59:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2022-11-16 11:59:52,122 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2022-11-16 11:59:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:52,122 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2022-11-16 11:59:52,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2022-11-16 11:59:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:59:52,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:52,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:52,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:59:52,124 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2022-11-16 11:59:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:52,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3636655] [2022-11-16 11:59:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:52,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:52,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3636655] [2022-11-16 11:59:52,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3636655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:52,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:52,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060651022] [2022-11-16 11:59:52,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:52,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:52,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:52,236 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:52,401 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2022-11-16 11:59:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:52,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-11-16 11:59:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:52,403 INFO L225 Difference]: With dead ends: 191 [2022-11-16 11:59:52,403 INFO L226 Difference]: Without dead ends: 191 [2022-11-16 11:59:52,403 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:59:52,405 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:52,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 196 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-16 11:59:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2022-11-16 11:59:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 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) [2022-11-16 11:59:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2022-11-16 11:59:52,414 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2022-11-16 11:59:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:52,414 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2022-11-16 11:59:52,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2022-11-16 11:59:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:59:52,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:52,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:52,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:59:52,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2022-11-16 11:59:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:52,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492578574] [2022-11-16 11:59:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:52,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:52,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492578574] [2022-11-16 11:59:52,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492578574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:52,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:52,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056387593] [2022-11-16 11:59:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:52,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:52,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:52,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:52,513 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:52,670 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-11-16 11:59:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-11-16 11:59:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:52,672 INFO L225 Difference]: With dead ends: 157 [2022-11-16 11:59:52,672 INFO L226 Difference]: Without dead ends: 157 [2022-11-16 11:59:52,672 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:59:52,708 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:52,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:59:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-16 11:59:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-16 11:59:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 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) [2022-11-16 11:59:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-11-16 11:59:52,724 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2022-11-16 11:59:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:52,724 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-11-16 11:59:52,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-11-16 11:59:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-11-16 11:59:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:59:52,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:52,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:59:52,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2022-11-16 11:59:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:52,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116416825] [2022-11-16 11:59:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:52,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116416825] [2022-11-16 11:59:52,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116416825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:52,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:52,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:52,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403948807] [2022-11-16 11:59:52,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:52,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:59:52,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:52,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:59:52,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:59:52,834 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:52,888 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-11-16 11:59:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:59:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 11:59:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:52,890 INFO L225 Difference]: With dead ends: 295 [2022-11-16 11:59:52,891 INFO L226 Difference]: Without dead ends: 295 [2022-11-16 11:59:52,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:59:52,893 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 149 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:52,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 454 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:59:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-16 11:59:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2022-11-16 11:59:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 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) [2022-11-16 11:59:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2022-11-16 11:59:52,900 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2022-11-16 11:59:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:52,900 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2022-11-16 11:59:52,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2022-11-16 11:59:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:59:52,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:52,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:52,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:59:52,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2022-11-16 11:59:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:52,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717296534] [2022-11-16 11:59:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:52,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:53,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:53,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717296534] [2022-11-16 11:59:53,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717296534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:53,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:53,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160354735] [2022-11-16 11:59:53,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:53,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:53,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:53,038 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2022-11-16 11:59:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:53,148 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-11-16 11:59:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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 [2022-11-16 11:59:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:53,150 INFO L225 Difference]: With dead ends: 156 [2022-11-16 11:59:53,150 INFO L226 Difference]: Without dead ends: 156 [2022-11-16 11:59:53,150 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:59:53,151 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:53,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:59:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-16 11:59:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-16 11:59:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 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) [2022-11-16 11:59:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-11-16 11:59:53,156 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2022-11-16 11:59:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:53,157 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-11-16 11:59:53,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2022-11-16 11:59:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-11-16 11:59:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:59:53,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:53,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:53,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:59:53,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2022-11-16 11:59:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:53,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641595252] [2022-11-16 11:59:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:53,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641595252] [2022-11-16 11:59:53,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641595252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:53,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:53,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331158281] [2022-11-16 11:59:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:53,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:53,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:53,280 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2022-11-16 11:59:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:53,417 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-11-16 11:59:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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 [2022-11-16 11:59:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:53,419 INFO L225 Difference]: With dead ends: 153 [2022-11-16 11:59:53,419 INFO L226 Difference]: Without dead ends: 153 [2022-11-16 11:59:53,420 INFO L412 NwaCegarLoop]: 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 [2022-11-16 11:59:53,423 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:53,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:59:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-16 11:59:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-11-16 11:59:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 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) [2022-11-16 11:59:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-11-16 11:59:53,435 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2022-11-16 11:59:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:53,436 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-11-16 11:59:53,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2022-11-16 11:59:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-11-16 11:59:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:59:53,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:53,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:53,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:59:53,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2022-11-16 11:59:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:53,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029243793] [2022-11-16 11:59:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:53,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:53,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:53,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029243793] [2022-11-16 11:59:53,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029243793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:53,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:53,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908574287] [2022-11-16 11:59:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:53,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:59:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:59:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:59:53,621 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-11-16 11:59:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:53,780 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2022-11-16 11:59:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:59:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2022-11-16 11:59:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:53,782 INFO L225 Difference]: With dead ends: 261 [2022-11-16 11:59:53,782 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 11:59:53,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:53,786 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:53,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:59:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 11:59:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2022-11-16 11:59:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 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) [2022-11-16 11:59:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2022-11-16 11:59:53,793 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2022-11-16 11:59:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:53,793 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2022-11-16 11:59:53,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-11-16 11:59:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2022-11-16 11:59:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:59:53,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:53,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:53,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:59:53,795 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2022-11-16 11:59:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:53,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941169017] [2022-11-16 11:59:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:53,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941169017] [2022-11-16 11:59:53,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941169017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:53,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:53,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386841707] [2022-11-16 11:59:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:53,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:59:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:59:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:53,916 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-11-16 11:59:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:54,103 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-11-16 11:59:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:59:54,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2022-11-16 11:59:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:54,104 INFO L225 Difference]: With dead ends: 147 [2022-11-16 11:59:54,104 INFO L226 Difference]: Without dead ends: 147 [2022-11-16 11:59:54,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:54,105 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:54,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 224 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-16 11:59:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-11-16 11:59:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 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) [2022-11-16 11:59:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2022-11-16 11:59:54,110 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2022-11-16 11:59:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:54,110 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2022-11-16 11:59:54,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-11-16 11:59:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2022-11-16 11:59:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:59:54,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:54,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:54,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:59:54,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2022-11-16 11:59:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:54,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881926225] [2022-11-16 11:59:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:54,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:54,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881926225] [2022-11-16 11:59:54,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881926225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:54,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:54,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158080847] [2022-11-16 11:59:54,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:59:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:59:54,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:54,270 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-11-16 11:59:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:54,550 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2022-11-16 11:59:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:59:54,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2022-11-16 11:59:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:54,552 INFO L225 Difference]: With dead ends: 239 [2022-11-16 11:59:54,552 INFO L226 Difference]: Without dead ends: 239 [2022-11-16 11:59:54,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:59:54,553 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 326 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:54,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 226 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-16 11:59:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2022-11-16 11:59:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 states have internal predecessors, (235), 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) [2022-11-16 11:59:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2022-11-16 11:59:54,557 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2022-11-16 11:59:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:54,558 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2022-11-16 11:59:54,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-11-16 11:59:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2022-11-16 11:59:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:59:54,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:54,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:54,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:59:54,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2022-11-16 11:59:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:54,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723566537] [2022-11-16 11:59:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:54,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723566537] [2022-11-16 11:59:54,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723566537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:54,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:54,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542844891] [2022-11-16 11:59:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:54,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:59:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:54,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:59:54,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:54,713 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-11-16 11:59:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:54,865 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2022-11-16 11:59:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:59:54,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-11-16 11:59:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:54,868 INFO L225 Difference]: With dead ends: 238 [2022-11-16 11:59:54,868 INFO L226 Difference]: Without dead ends: 238 [2022-11-16 11:59:54,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:59:54,870 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 258 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:54,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 360 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:59:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-16 11:59:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2022-11-16 11:59:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 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) [2022-11-16 11:59:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2022-11-16 11:59:54,876 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2022-11-16 11:59:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:54,876 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2022-11-16 11:59:54,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-11-16 11:59:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2022-11-16 11:59:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:59:54,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:54,884 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:54,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:59:54,885 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2022-11-16 11:59:54,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:54,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123533461] [2022-11-16 11:59:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:55,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:55,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123533461] [2022-11-16 11:59:55,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123533461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:55,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:55,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:59:55,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697182885] [2022-11-16 11:59:55,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:55,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:59:55,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:59:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:59:55,117 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-11-16 11:59:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:55,403 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-11-16 11:59:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:59:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2022-11-16 11:59:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:55,405 INFO L225 Difference]: With dead ends: 213 [2022-11-16 11:59:55,405 INFO L226 Difference]: Without dead ends: 213 [2022-11-16 11:59:55,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:59:55,406 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 19 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:55,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 396 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:59:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-16 11:59:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2022-11-16 11:59:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 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) [2022-11-16 11:59:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2022-11-16 11:59:55,411 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2022-11-16 11:59:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:55,412 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2022-11-16 11:59:55,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-11-16 11:59:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2022-11-16 11:59:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:59:55,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:55,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:55,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:59:55,413 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2022-11-16 11:59:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:55,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044127615] [2022-11-16 11:59:55,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:55,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044127615] [2022-11-16 11:59:55,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044127615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:55,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:55,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:59:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340276083] [2022-11-16 11:59:55,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:55,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:59:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:59:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:59:55,802 INFO L87 Difference]: Start difference. First operand 198 states and 252 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-11-16 11:59:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:55,982 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2022-11-16 11:59:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:59:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2022-11-16 11:59:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:55,984 INFO L225 Difference]: With dead ends: 225 [2022-11-16 11:59:55,984 INFO L226 Difference]: Without dead ends: 225 [2022-11-16 11:59:55,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:59:55,985 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 37 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:55,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 455 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-16 11:59:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2022-11-16 11:59:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 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) [2022-11-16 11:59:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2022-11-16 11:59:55,989 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2022-11-16 11:59:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:55,990 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2022-11-16 11:59:55,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-11-16 11:59:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2022-11-16 11:59:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:59:55,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:55,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:55,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:59:55,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2022-11-16 11:59:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:55,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793716057] [2022-11-16 11:59:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:56,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793716057] [2022-11-16 11:59:56,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793716057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:56,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:56,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:59:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021489369] [2022-11-16 11:59:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:56,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:59:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:56,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:59:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:59:56,592 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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) [2022-11-16 11:59:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:57,321 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2022-11-16 11:59:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:59:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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 32 [2022-11-16 11:59:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:57,323 INFO L225 Difference]: With dead ends: 307 [2022-11-16 11:59:57,323 INFO L226 Difference]: Without dead ends: 307 [2022-11-16 11:59:57,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:59:57,324 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 226 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:57,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 530 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:59:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-16 11:59:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2022-11-16 11:59:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 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) [2022-11-16 11:59:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2022-11-16 11:59:57,329 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2022-11-16 11:59:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:57,329 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2022-11-16 11:59:57,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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) [2022-11-16 11:59:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2022-11-16 11:59:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:59:57,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:57,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:57,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:59:57,331 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2022-11-16 11:59:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:57,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907201061] [2022-11-16 11:59:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907201061] [2022-11-16 11:59:58,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907201061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:58,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:58,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:59:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531367542] [2022-11-16 11:59:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:58,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:59:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:58,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:59:58,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:59:58,084 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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) [2022-11-16 11:59:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:58,673 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-11-16 11:59:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:59:58,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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 32 [2022-11-16 11:59:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:58,676 INFO L225 Difference]: With dead ends: 309 [2022-11-16 11:59:58,676 INFO L226 Difference]: Without dead ends: 309 [2022-11-16 11:59:58,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:59:58,677 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 196 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:58,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 359 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:59:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-16 11:59:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2022-11-16 11:59:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 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) [2022-11-16 11:59:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2022-11-16 11:59:58,683 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2022-11-16 11:59:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:58,684 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2022-11-16 11:59:58,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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) [2022-11-16 11:59:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2022-11-16 11:59:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 11:59:58,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:58,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:59:58,685 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2022-11-16 11:59:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:58,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864920451] [2022-11-16 11:59:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:59:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:58,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864920451] [2022-11-16 11:59:58,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864920451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:58,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:58,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:59:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053550361] [2022-11-16 11:59:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:58,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:59:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:59:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:59:58,978 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2022-11-16 11:59:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:59,231 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2022-11-16 11:59:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:59:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 [2022-11-16 11:59:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:59,233 INFO L225 Difference]: With dead ends: 254 [2022-11-16 11:59:59,233 INFO L226 Difference]: Without dead ends: 254 [2022-11-16 11:59:59,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:59:59,234 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 68 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:59,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 575 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-16 11:59:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2022-11-16 11:59:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 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) [2022-11-16 11:59:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2022-11-16 11:59:59,241 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2022-11-16 11:59:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:59,251 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2022-11-16 11:59:59,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2022-11-16 11:59:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2022-11-16 11:59:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:59:59,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:59,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:59,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:59:59,253 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2022-11-16 11:59:59,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:59,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747181712] [2022-11-16 11:59:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:59:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:59,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747181712] [2022-11-16 11:59:59,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747181712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:59,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:59,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:59:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883356856] [2022-11-16 11:59:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:59,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:59:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:59:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:59:59,329 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-11-16 11:59:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:59,544 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-11-16 11:59:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:59:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 34 [2022-11-16 11:59:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:59,546 INFO L225 Difference]: With dead ends: 299 [2022-11-16 11:59:59,546 INFO L226 Difference]: Without dead ends: 299 [2022-11-16 11:59:59,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:59,547 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:59,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 265 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-16 11:59:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2022-11-16 11:59:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 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) [2022-11-16 11:59:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2022-11-16 11:59:59,553 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2022-11-16 11:59:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:59,554 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2022-11-16 11:59:59,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2022-11-16 11:59:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2022-11-16 11:59:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:59:59,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:59,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:59,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:59:59,556 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 11:59:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2022-11-16 11:59:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:59,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67183795] [2022-11-16 11:59:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67183795] [2022-11-16 12:00:00,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67183795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:00,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:00,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:00:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818953154] [2022-11-16 12:00:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:00,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:00:00,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:00:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:00:00,408 INFO L87 Difference]: Start difference. First operand 228 states and 294 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-11-16 12:00:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:01,442 INFO L93 Difference]: Finished difference Result 293 states and 367 transitions. [2022-11-16 12:00:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:00:01,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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 34 [2022-11-16 12:00:01,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:01,444 INFO L225 Difference]: With dead ends: 293 [2022-11-16 12:00:01,444 INFO L226 Difference]: Without dead ends: 293 [2022-11-16 12:00:01,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2022-11-16 12:00:01,445 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 225 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:01,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 394 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:00:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-16 12:00:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2022-11-16 12:00:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 197 states have (on average 1.5482233502538072) internal successors, (305), 236 states have internal predecessors, (305), 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) [2022-11-16 12:00:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 305 transitions. [2022-11-16 12:00:01,463 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 305 transitions. Word has length 34 [2022-11-16 12:00:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:01,464 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 305 transitions. [2022-11-16 12:00:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-11-16 12:00:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 305 transitions. [2022-11-16 12:00:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:00:01,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:01,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:01,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:00:01,467 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:00:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2022-11-16 12:00:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:01,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922726509] [2022-11-16 12:00:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:02,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922726509] [2022-11-16 12:00:02,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922726509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:02,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944042195] [2022-11-16 12:00:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:02,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:00:02,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:00:02,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:00:02,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:00:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:02,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 12:00:02,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:02,930 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:00:02,935 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:00:03,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:03,008 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 12:00:03,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:03,017 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 12:00:03,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:03,064 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 12:00:03,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:03,074 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 12:00:03,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:03,101 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 12:00:03,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:03,111 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 12:00:03,186 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:00:03,186 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2022-11-16 12:00:03,202 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 12:00:03,222 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:00:03,222 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2022-11-16 12:00:03,233 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 12:00:03,358 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-16 12:00:03,367 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 30 [2022-11-16 12:00:03,968 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:00:04,435 INFO L321 Elim1Store]: treesize reduction 116, result has 24.2 percent of original size [2022-11-16 12:00:04,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 119 [2022-11-16 12:00:04,531 INFO L321 Elim1Store]: treesize reduction 116, result has 24.2 percent of original size [2022-11-16 12:00:04,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92 [2022-11-16 12:00:04,593 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-11-16 12:00:04,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 72 [2022-11-16 12:00:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:04,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:04,927 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-16 12:00:05,931 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-16 12:00:05,932 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2022-11-16 12:00:05,940 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 85 [2022-11-16 12:00:06,517 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-16 12:00:06,518 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 84 [2022-11-16 12:00:06,532 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 70 [2022-11-16 12:00:07,299 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse3 (not (<= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (.cse28 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse4 (not (<= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)))) (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse1 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) v_arrayElimCell_32) 0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse2 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse2) v_arrayElimCell_32) 0)))))) (or .cse3 .cse4 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse6 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse5 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse6 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse7 .cse6) v_arrayElimCell_32) 0))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30))) (or (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse8 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (or .cse3 .cse4 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse10 (select v_arrayElimArr_1 .cse0))) (or (= (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse10)) (= (select (select .cse9 v_arrayElimCell_30) .cse10) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse11 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse13 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse12 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse13 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse12 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse14 .cse13) v_arrayElimCell_32) 0))))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse15 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse15 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (or .cse3 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse17 (select v_arrayElimArr_1 .cse0))) (or (= (select (select .cse16 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse17)) (= (select (select .cse16 v_arrayElimCell_30) .cse17) 0)))) .cse4) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2)) (.cse19 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse18 |c_ULTIMATE.start_main_~item~0#1.base|) v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse19 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select .cse18 .cse19) v_arrayElimCell_32) 0)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2)) (.cse21 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse20 |c_ULTIMATE.start_main_~item~0#1.base|) v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse21 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select .cse20 .cse21) v_arrayElimCell_32) 0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse23 (select .cse22 v_arrayElimCell_30))) (or (= (select (select .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse23 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse23 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (or .cse3 .cse4 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse25 (select .cse24 v_arrayElimCell_30))) (or (= (select (select .cse24 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse25 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse25 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))))))))) (or .cse3 .cse4 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_31 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse27 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse26 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse27 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse26 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) .cse28)) (or .cse3 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse29 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse29 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) .cse28 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse31 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse30 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse31 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse30 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse4)))) is different from false [2022-11-16 12:00:08,683 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse0 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse2 (select v_arrayElimArr_1 4))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse2)) (= 0 (select (select .cse1 v_arrayElimCell_30) .cse2))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse4)) (= 0 (select (select .cse3 v_arrayElimCell_30) .cse4))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse6 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_31 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse7 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse8 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse7 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse9 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse10 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-11-16 12:00:09,057 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse1 (select v_arrayElimArr_1 4))) (or (= (select (select .cse0 v_arrayElimCell_30) .cse1) 0) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse5 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse4 v_arrayElimCell_32) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse7 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse7 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse7 v_arrayElimCell_32) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse9 (select v_arrayElimArr_1 4))) (or (= (select (select .cse8 v_arrayElimCell_30) .cse9) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse8 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse9))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_31 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse10 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse11 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse10 v_arrayElimCell_32) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse12 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse13 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))))) is different from false [2022-11-16 12:00:10,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:10,263 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:00:10,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-11-16 12:00:10,270 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-16 12:00:10,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2022-11-16 12:00:10,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:10,286 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:00:10,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-11-16 12:00:10,293 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-16 12:00:10,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 1 [2022-11-16 12:00:10,301 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-16 12:00:10,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 1 [2022-11-16 12:00:10,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:10,310 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:00:10,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 1 [2022-11-16 12:00:10,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:10,322 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:00:10,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-11-16 12:00:10,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:10,332 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:00:10,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 1 [2022-11-16 12:00:10,338 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-16 12:00:10,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 1 [2022-11-16 12:00:10,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:10,346 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:00:10,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-11-16 12:00:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:10,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944042195] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:00:10,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:00:10,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2022-11-16 12:00:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629680278] [2022-11-16 12:00:10,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:10,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 12:00:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 12:00:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1210, Unknown=3, NotChecked=216, Total=1560 [2022-11-16 12:00:10,352 INFO L87 Difference]: Start difference. First operand 237 states and 305 transitions. Second operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:00:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:18,467 INFO L93 Difference]: Finished difference Result 283 states and 354 transitions. [2022-11-16 12:00:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:00:18,468 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-16 12:00:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:18,470 INFO L225 Difference]: With dead ends: 283 [2022-11-16 12:00:18,470 INFO L226 Difference]: Without dead ends: 283 [2022-11-16 12:00:18,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=393, Invalid=3038, Unknown=3, NotChecked=348, Total=3782 [2022-11-16 12:00:18,472 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 254 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 809 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:18,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1929 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1384 Invalid, 0 Unknown, 809 Unchecked, 1.4s Time] [2022-11-16 12:00:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-16 12:00:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 240. [2022-11-16 12:00:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.54) internal successors, (308), 239 states have internal predecessors, (308), 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) [2022-11-16 12:00:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 308 transitions. [2022-11-16 12:00:18,482 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 308 transitions. Word has length 39 [2022-11-16 12:00:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:18,482 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 308 transitions. [2022-11-16 12:00:18,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:00:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 308 transitions. [2022-11-16 12:00:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:00:18,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:18,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:18,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:18,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:00:18,691 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:00:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2022-11-16 12:00:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:18,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649686848] [2022-11-16 12:00:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:19,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:19,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649686848] [2022-11-16 12:00:19,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649686848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:19,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:19,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:00:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133669959] [2022-11-16 12:00:19,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:19,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:00:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:00:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:00:19,097 INFO L87 Difference]: Start difference. First operand 240 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 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) [2022-11-16 12:00:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:19,783 INFO L93 Difference]: Finished difference Result 345 states and 420 transitions. [2022-11-16 12:00:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:00:19,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 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 41 [2022-11-16 12:00:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:19,786 INFO L225 Difference]: With dead ends: 345 [2022-11-16 12:00:19,786 INFO L226 Difference]: Without dead ends: 345 [2022-11-16 12:00:19,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:00:19,787 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 222 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:19,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 545 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:00:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-16 12:00:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 249. [2022-11-16 12:00:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5358851674641147) internal successors, (321), 248 states have internal predecessors, (321), 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) [2022-11-16 12:00:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 321 transitions. [2022-11-16 12:00:19,794 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 321 transitions. Word has length 41 [2022-11-16 12:00:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:19,794 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 321 transitions. [2022-11-16 12:00:19,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 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) [2022-11-16 12:00:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 321 transitions. [2022-11-16 12:00:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:00:19,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:19,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:19,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:00:19,796 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:00:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2022-11-16 12:00:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291054463] [2022-11-16 12:00:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291054463] [2022-11-16 12:00:20,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291054463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:20,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:20,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-16 12:00:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652397561] [2022-11-16 12:00:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:00:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:20,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:00:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:00:20,980 INFO L87 Difference]: Start difference. First operand 249 states and 321 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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) [2022-11-16 12:00:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:22,802 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2022-11-16 12:00:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 12:00:22,803 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 42 [2022-11-16 12:00:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:22,805 INFO L225 Difference]: With dead ends: 271 [2022-11-16 12:00:22,805 INFO L226 Difference]: Without dead ends: 271 [2022-11-16 12:00:22,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 12:00:22,806 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 198 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:22,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 855 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:00:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-16 12:00:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 249. [2022-11-16 12:00:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5311004784688995) internal successors, (320), 248 states have internal predecessors, (320), 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) [2022-11-16 12:00:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 320 transitions. [2022-11-16 12:00:22,815 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 320 transitions. Word has length 42 [2022-11-16 12:00:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:22,815 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 320 transitions. [2022-11-16 12:00:22,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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) [2022-11-16 12:00:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 320 transitions. [2022-11-16 12:00:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:00:22,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:22,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:22,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 12:00:22,838 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:00:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2022-11-16 12:00:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:22,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264247295] [2022-11-16 12:00:22,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:00:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:23,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264247295] [2022-11-16 12:00:23,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264247295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:23,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963596648] [2022-11-16 12:00:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:00:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:00:23,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:00:23,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:00:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:23,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:00:23,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:23,576 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:00:23,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 18 treesize of output 32 [2022-11-16 12:00:23,686 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:00:23,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:00:23,836 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 30 [2022-11-16 12:00:24,035 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:00:24,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2022-11-16 12:00:24,299 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:00:24,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 32 [2022-11-16 12:00:24,314 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~item2~0#1.base| Int) (|ULTIMATE.start_main_~data~0#1.base| Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~item2~0#1.base|))) (and (= (select |c_#valid| |ULTIMATE.start_main_~data~0#1.base|) 0) (= (select |c_#valid| |ULTIMATE.start_main_~item2~0#1.base|) 0) (= .cse0 0) (= (store (store (store |c_#valid| |ULTIMATE.start_main_~item2~0#1.base| .cse1) |ULTIMATE.start_main_~data~0#1.base| .cse0) |ULTIMATE.start_main_~item2~0#1.base| .cse1) |c_ULTIMATE.start_main_old_#valid#1|) (= .cse1 0)))) is different from true [2022-11-16 12:00:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 12:00:24,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:24,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) is different from false [2022-11-16 12:00:24,574 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 44 [2022-11-16 12:01:00,980 WARN L233 SmtUtils]: Spent 30.14s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:01:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 12:01:09,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963596648] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:09,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:01:09,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2022-11-16 12:01:09,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993692389] [2022-11-16 12:01:09,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:09,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 12:01:09,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:09,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 12:01:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=8, NotChecked=102, Total=812 [2022-11-16 12:01:09,326 INFO L87 Difference]: Start difference. First operand 249 states and 320 transitions. Second operand has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:01:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:10,231 INFO L93 Difference]: Finished difference Result 251 states and 321 transitions. [2022-11-16 12:01:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:01:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-16 12:01:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:10,233 INFO L225 Difference]: With dead ends: 251 [2022-11-16 12:01:10,233 INFO L226 Difference]: Without dead ends: 228 [2022-11-16 12:01:10,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=8, NotChecked=122, Total=1122 [2022-11-16 12:01:10,235 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 33 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:10,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1013 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 645 Invalid, 0 Unknown, 589 Unchecked, 0.7s Time] [2022-11-16 12:01:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-16 12:01:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-11-16 12:01:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5851063829787233) internal successors, (298), 227 states have internal predecessors, (298), 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) [2022-11-16 12:01:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2022-11-16 12:01:10,242 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2022-11-16 12:01:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:10,243 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2022-11-16 12:01:10,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:01:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2022-11-16 12:01:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:01:10,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:10,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:10,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:10,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 12:01:10,451 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1291794435, now seen corresponding path program 1 times [2022-11-16 12:01:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:10,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210510733] [2022-11-16 12:01:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210510733] [2022-11-16 12:01:10,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210510733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564443008] [2022-11-16 12:01:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:10,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:10,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:10,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:01:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:10,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:01:10,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 12:01:10,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:01:10,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564443008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:01:10,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:01:10,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-16 12:01:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536105132] [2022-11-16 12:01:10,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:01:10,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:01:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:10,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:01:10,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:01:10,852 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2022-11-16 12:01:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:10,893 INFO L93 Difference]: Finished difference Result 391 states and 508 transitions. [2022-11-16 12:01:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:01:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 45 [2022-11-16 12:01:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:10,896 INFO L225 Difference]: With dead ends: 391 [2022-11-16 12:01:10,896 INFO L226 Difference]: Without dead ends: 389 [2022-11-16 12:01:10,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:01:10,898 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:10,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 384 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:01:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-16 12:01:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 239. [2022-11-16 12:01:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 199 states have (on average 1.5326633165829147) internal successors, (305), 238 states have internal predecessors, (305), 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) [2022-11-16 12:01:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 305 transitions. [2022-11-16 12:01:10,906 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 305 transitions. Word has length 45 [2022-11-16 12:01:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:10,907 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 305 transitions. [2022-11-16 12:01:10,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2022-11-16 12:01:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 305 transitions. [2022-11-16 12:01:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:01:10,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:10,908 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:10,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:11,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 12:01:11,115 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1971852805, now seen corresponding path program 1 times [2022-11-16 12:01:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:11,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412010456] [2022-11-16 12:01:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:11,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412010456] [2022-11-16 12:01:11,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412010456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:11,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933567915] [2022-11-16 12:01:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:11,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:11,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:01:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:11,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:01:11,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:11,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:11,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933567915] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:11,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:01:11,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-11-16 12:01:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364657976] [2022-11-16 12:01:11,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:11,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:01:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:01:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:01:11,570 INFO L87 Difference]: Start difference. First operand 239 states and 305 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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) [2022-11-16 12:01:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:11,685 INFO L93 Difference]: Finished difference Result 1027 states and 1353 transitions. [2022-11-16 12:01:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:01:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 45 [2022-11-16 12:01:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:11,689 INFO L225 Difference]: With dead ends: 1027 [2022-11-16 12:01:11,690 INFO L226 Difference]: Without dead ends: 1027 [2022-11-16 12:01:11,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:01:11,691 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 746 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:11,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 936 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:01:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-11-16 12:01:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 273. [2022-11-16 12:01:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.4721030042918455) internal successors, (343), 272 states have internal predecessors, (343), 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) [2022-11-16 12:01:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2022-11-16 12:01:11,703 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 45 [2022-11-16 12:01:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:11,704 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2022-11-16 12:01:11,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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) [2022-11-16 12:01:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2022-11-16 12:01:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 12:01:11,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:11,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:11,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:11,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:11,911 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:11,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash 69553884, now seen corresponding path program 1 times [2022-11-16 12:01:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:11,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467673441] [2022-11-16 12:01:11,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:12,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467673441] [2022-11-16 12:01:12,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467673441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:12,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607028938] [2022-11-16 12:01:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:12,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:12,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:12,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:12,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:01:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:12,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:01:12,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:12,671 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:12,779 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:12,786 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:12,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:12,845 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-11-16 12:01:12,868 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 12:01:12,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2022-11-16 12:01:12,967 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:13,088 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2022-11-16 12:01:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:13,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:01:13,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607028938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:01:13,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:01:13,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2022-11-16 12:01:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639730605] [2022-11-16 12:01:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:01:13,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:01:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:01:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:01:13,097 INFO L87 Difference]: Start difference. First operand 273 states and 343 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 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) [2022-11-16 12:01:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:13,689 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2022-11-16 12:01:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:01:13,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 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) Word has length 47 [2022-11-16 12:01:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:13,691 INFO L225 Difference]: With dead ends: 299 [2022-11-16 12:01:13,691 INFO L226 Difference]: Without dead ends: 299 [2022-11-16 12:01:13,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:01:13,692 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 320 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:13,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 544 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:01:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-16 12:01:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 273. [2022-11-16 12:01:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.4678111587982832) internal successors, (342), 272 states have internal predecessors, (342), 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) [2022-11-16 12:01:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2022-11-16 12:01:13,709 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 47 [2022-11-16 12:01:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:13,709 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2022-11-16 12:01:13,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 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) [2022-11-16 12:01:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2022-11-16 12:01:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 12:01:13,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:13,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:13,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:13,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:13,917 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash 69553885, now seen corresponding path program 1 times [2022-11-16 12:01:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:13,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158800114] [2022-11-16 12:01:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:14,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158800114] [2022-11-16 12:01:14,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158800114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:14,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586625649] [2022-11-16 12:01:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:14,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:14,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:14,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:14,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:01:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:15,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:01:15,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:15,190 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:15,299 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:15,307 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:15,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:15,365 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-11-16 12:01:15,388 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 12:01:15,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2022-11-16 12:01:15,616 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2022-11-16 12:01:15,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-16 12:01:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:15,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:01:15,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586625649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:01:15,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:01:15,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2022-11-16 12:01:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931815806] [2022-11-16 12:01:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:01:15,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:01:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:01:15,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:01:15,649 INFO L87 Difference]: Start difference. First operand 273 states and 342 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 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) [2022-11-16 12:01:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:16,214 INFO L93 Difference]: Finished difference Result 319 states and 368 transitions. [2022-11-16 12:01:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:01:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 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) Word has length 47 [2022-11-16 12:01:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:16,217 INFO L225 Difference]: With dead ends: 319 [2022-11-16 12:01:16,217 INFO L226 Difference]: Without dead ends: 319 [2022-11-16 12:01:16,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:01:16,218 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 342 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:16,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 510 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:01:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-16 12:01:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 273. [2022-11-16 12:01:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.463519313304721) internal successors, (341), 272 states have internal predecessors, (341), 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) [2022-11-16 12:01:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2022-11-16 12:01:16,225 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 47 [2022-11-16 12:01:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:16,225 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2022-11-16 12:01:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 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) [2022-11-16 12:01:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2022-11-16 12:01:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 12:01:16,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:16,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:16,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:16,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 12:01:16,427 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1479009528, now seen corresponding path program 1 times [2022-11-16 12:01:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:16,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134292315] [2022-11-16 12:01:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:16,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:16,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134292315] [2022-11-16 12:01:16,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134292315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:16,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448965572] [2022-11-16 12:01:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:16,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:16,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:16,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:16,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:01:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:16,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:01:16,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:16,972 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:17,009 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:01:17,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:01:17,036 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:01:17,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:01:17,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:01:17,067 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:01:17,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:01:17,083 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2022-11-16 12:01:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:17,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:17,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1569) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) is different from false [2022-11-16 12:01:17,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:17,116 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-16 12:01:17,123 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 25 [2022-11-16 12:01:17,127 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 12:01:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448965572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:17,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:01:17,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-11-16 12:01:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472342842] [2022-11-16 12:01:17,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:17,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:01:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:17,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:01:17,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-11-16 12:01:17,220 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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) [2022-11-16 12:01:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:17,629 INFO L93 Difference]: Finished difference Result 273 states and 338 transitions. [2022-11-16 12:01:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:01:17,629 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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 50 [2022-11-16 12:01:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:17,631 INFO L225 Difference]: With dead ends: 273 [2022-11-16 12:01:17,631 INFO L226 Difference]: Without dead ends: 273 [2022-11-16 12:01:17,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=251, Unknown=1, NotChecked=34, Total=380 [2022-11-16 12:01:17,632 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 106 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:17,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 621 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 344 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-11-16 12:01:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-16 12:01:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2022-11-16 12:01:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 229 states have (on average 1.4672489082969433) internal successors, (336), 268 states have internal predecessors, (336), 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) [2022-11-16 12:01:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 336 transitions. [2022-11-16 12:01:17,649 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 336 transitions. Word has length 50 [2022-11-16 12:01:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:17,649 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 336 transitions. [2022-11-16 12:01:17,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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) [2022-11-16 12:01:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 336 transitions. [2022-11-16 12:01:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:01:17,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:17,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:17,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:17,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 12:01:17,857 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909602, now seen corresponding path program 1 times [2022-11-16 12:01:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:17,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010651888] [2022-11-16 12:01:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 12:01:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:18,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010651888] [2022-11-16 12:01:18,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010651888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:01:18,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:01:18,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:01:18,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500631805] [2022-11-16 12:01:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:01:18,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:01:18,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:18,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:01:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:01:18,011 INFO L87 Difference]: Start difference. First operand 269 states and 336 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2022-11-16 12:01:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:18,289 INFO L93 Difference]: Finished difference Result 268 states and 334 transitions. [2022-11-16 12:01:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:01:18,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 51 [2022-11-16 12:01:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:18,292 INFO L225 Difference]: With dead ends: 268 [2022-11-16 12:01:18,292 INFO L226 Difference]: Without dead ends: 268 [2022-11-16 12:01:18,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:01:18,293 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 27 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:18,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 386 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:01:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-16 12:01:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-11-16 12:01:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.4585152838427948) internal successors, (334), 267 states have internal predecessors, (334), 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) [2022-11-16 12:01:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 334 transitions. [2022-11-16 12:01:18,301 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 334 transitions. Word has length 51 [2022-11-16 12:01:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:18,301 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 334 transitions. [2022-11-16 12:01:18,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2022-11-16 12:01:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 334 transitions. [2022-11-16 12:01:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:01:18,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:18,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:18,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 12:01:18,303 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909601, now seen corresponding path program 1 times [2022-11-16 12:01:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973551148] [2022-11-16 12:01:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:18,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973551148] [2022-11-16 12:01:18,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973551148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:18,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643970032] [2022-11-16 12:01:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:18,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:18,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:18,999 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:19,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:01:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:19,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:01:19,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:19,421 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:19,476 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:01:19,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2022-11-16 12:01:19,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-16 12:01:19,681 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 14 [2022-11-16 12:01:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:19,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:01:19,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643970032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:01:19,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:01:19,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2022-11-16 12:01:19,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124854306] [2022-11-16 12:01:19,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:01:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:01:19,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:01:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:01:19,744 INFO L87 Difference]: Start difference. First operand 268 states and 334 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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) [2022-11-16 12:01:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:20,471 INFO L93 Difference]: Finished difference Result 338 states and 388 transitions. [2022-11-16 12:01:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:01:20,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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 51 [2022-11-16 12:01:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:20,473 INFO L225 Difference]: With dead ends: 338 [2022-11-16 12:01:20,473 INFO L226 Difference]: Without dead ends: 338 [2022-11-16 12:01:20,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:01:20,475 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 515 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:20,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 559 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:01:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-16 12:01:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2022-11-16 12:01:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 267 states have internal predecessors, (332), 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) [2022-11-16 12:01:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 332 transitions. [2022-11-16 12:01:20,484 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 332 transitions. Word has length 51 [2022-11-16 12:01:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:20,484 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 332 transitions. [2022-11-16 12:01:20,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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) [2022-11-16 12:01:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 332 transitions. [2022-11-16 12:01:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:01:20,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:20,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:20,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 12:01:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:20,693 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 455851009, now seen corresponding path program 1 times [2022-11-16 12:01:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:20,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142123763] [2022-11-16 12:01:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:21,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142123763] [2022-11-16 12:01:21,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142123763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:21,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749619929] [2022-11-16 12:01:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:21,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:21,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:21,287 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:21,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:01:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:21,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:01:21,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:21,714 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:21,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:21,761 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 12:01:21,859 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-16 12:01:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:21,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:22,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749619929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:22,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:01:22,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-16 12:01:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407041685] [2022-11-16 12:01:22,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:22,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:01:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:01:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:01:22,141 INFO L87 Difference]: Start difference. First operand 268 states and 332 transitions. Second operand has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 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) [2022-11-16 12:01:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:22,667 INFO L93 Difference]: Finished difference Result 288 states and 334 transitions. [2022-11-16 12:01:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:01:22,668 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 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 55 [2022-11-16 12:01:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:22,669 INFO L225 Difference]: With dead ends: 288 [2022-11-16 12:01:22,670 INFO L226 Difference]: Without dead ends: 288 [2022-11-16 12:01:22,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-11-16 12:01:22,671 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 589 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:22,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 549 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 221 Invalid, 0 Unknown, 3 Unchecked, 0.3s Time] [2022-11-16 12:01:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-16 12:01:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2022-11-16 12:01:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.445414847161572) internal successors, (331), 267 states have internal predecessors, (331), 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) [2022-11-16 12:01:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 331 transitions. [2022-11-16 12:01:22,680 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 331 transitions. Word has length 55 [2022-11-16 12:01:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:22,680 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 331 transitions. [2022-11-16 12:01:22,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 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) [2022-11-16 12:01:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 331 transitions. [2022-11-16 12:01:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:01:22,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:22,681 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:22,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:22,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:22,889 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:22,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:22,890 INFO L85 PathProgramCache]: Analyzing trace with hash -429024641, now seen corresponding path program 1 times [2022-11-16 12:01:22,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:22,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366325295] [2022-11-16 12:01:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:24,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:24,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366325295] [2022-11-16 12:01:24,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366325295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:24,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909076757] [2022-11-16 12:01:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:24,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:24,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:01:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:25,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-16 12:01:25,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:25,013 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:25,057 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:01:25,057 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:25,158 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:25,300 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-16 12:01:25,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 12:01:25,403 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 12:01:25,483 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 12:01:25,525 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 12:01:25,645 INFO L321 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2022-11-16 12:01:25,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2022-11-16 12:01:25,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-16 12:01:25,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:25,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-16 12:01:26,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:01:26,055 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2022-11-16 12:01:27,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:01:27,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:27,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 33 [2022-11-16 12:01:27,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:01:27,604 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:01:27,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 12:01:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:27,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:28,463 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 20 [2022-11-16 12:01:31,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:31,147 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 220 treesize of output 150 [2022-11-16 12:01:31,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:31,172 INFO L350 Elim1Store]: Elim1 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 871 treesize of output 864 [2022-11-16 12:01:31,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 849 treesize of output 769 [2022-11-16 12:01:31,242 INFO L350 Elim1Store]: Elim1 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 187 treesize of output 179 [2022-11-16 12:01:31,260 INFO L350 Elim1Store]: Elim1 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 366 treesize of output 350 [2022-11-16 12:01:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:33,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909076757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:33,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:01:33,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 58 [2022-11-16 12:01:33,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980492360] [2022-11-16 12:01:33,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:33,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-16 12:01:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-16 12:01:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=3049, Unknown=18, NotChecked=0, Total=3422 [2022-11-16 12:01:33,870 INFO L87 Difference]: Start difference. First operand 268 states and 331 transitions. Second operand has 59 states, 58 states have (on average 2.8275862068965516) internal successors, (164), 59 states have internal predecessors, (164), 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) [2022-11-16 12:01:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:37,277 INFO L93 Difference]: Finished difference Result 407 states and 493 transitions. [2022-11-16 12:01:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 12:01:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.8275862068965516) internal successors, (164), 59 states have internal predecessors, (164), 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 58 [2022-11-16 12:01:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:37,279 INFO L225 Difference]: With dead ends: 407 [2022-11-16 12:01:37,279 INFO L226 Difference]: Without dead ends: 407 [2022-11-16 12:01:37,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1910 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=747, Invalid=5087, Unknown=18, NotChecked=0, Total=5852 [2022-11-16 12:01:37,282 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 208 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 841 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:37,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1647 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 901 Invalid, 0 Unknown, 841 Unchecked, 0.9s Time] [2022-11-16 12:01:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-16 12:01:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 386. [2022-11-16 12:01:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 347 states have (on average 1.3487031700288183) internal successors, (468), 385 states have internal predecessors, (468), 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) [2022-11-16 12:01:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 468 transitions. [2022-11-16 12:01:37,292 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 468 transitions. Word has length 58 [2022-11-16 12:01:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:37,293 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 468 transitions. [2022-11-16 12:01:37,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.8275862068965516) internal successors, (164), 59 states have internal predecessors, (164), 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) [2022-11-16 12:01:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 468 transitions. [2022-11-16 12:01:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:01:37,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:37,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:37,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:37,502 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-16 12:01:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -429024640, now seen corresponding path program 1 times [2022-11-16 12:01:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131447673] [2022-11-16 12:01:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:39,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:39,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131447673] [2022-11-16 12:01:39,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131447673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:39,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704235304] [2022-11-16 12:01:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:39,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:39,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:39,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d61f340-9001-4176-9109-acf00c9a69db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:01:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:39,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-16 12:01:39,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:39,843 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:39,848 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:39,945 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:01:39,946 INFO L350 Elim1Store]: Elim1 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 18 [2022-11-16 12:01:39,972 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:01:39,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:01:40,106 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 12:01:40,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:01:40,261 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-16 12:01:40,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 12:01:40,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:01:40,392 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 37 [2022-11-16 12:01:40,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:01:40,511 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 37 [2022-11-16 12:01:40,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:01:40,609 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 37 [2022-11-16 12:01:40,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:01:40,712 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 12:01:40,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 12:01:40,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:01:40,909 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 30 [2022-11-16 12:01:40,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:01:40,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:40,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-16 12:01:41,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:41,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 12:01:41,108 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:01:41,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2022-11-16 12:01:41,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-16 12:01:41,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:01:41,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:41,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 31 [2022-11-16 12:01:41,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:01:41,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:41,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2022-11-16 12:01:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:42,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:48,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:48,791 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 152 treesize of output 143 [2022-11-16 12:01:48,819 INFO L350 Elim1Store]: Elim1 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 896 treesize of output 890 [2022-11-16 12:01:48,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:48,832 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 1177 treesize of output 747 [2022-11-16 12:01:48,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:48,869 INFO L350 Elim1Store]: Elim1 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 3863 treesize of output 3843 [2022-11-16 12:01:48,910 INFO L350 Elim1Store]: Elim1 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 2966 treesize of output 2838 [2022-11-16 12:01:48,969 INFO L350 Elim1Store]: Elim1 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 3611 treesize of output 3599 [2022-11-16 12:01:49,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4423 treesize of output 4303 [2022-11-16 12:01:49,182 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-16 12:01:49,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:01:49,488 INFO L350 Elim1Store]: Elim1 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 4065 treesize of output 4061 [2022-11-16 12:06:42,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:06:42,413 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 309 treesize of output 279 [2022-11-16 12:06:42,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:06:42,456 INFO L350 Elim1Store]: Elim1 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 3721 treesize of output 3714 [2022-11-16 12:06:42,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:06:42,516 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 3891 treesize of output 2541 [2022-11-16 12:06:42,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:06:42,594 INFO L350 Elim1Store]: Elim1 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 14989 treesize of output 14863 [2022-11-16 12:06:42,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14315 treesize of output 13547 [2022-11-16 12:06:42,871 INFO L350 Elim1Store]: Elim1 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 14489 treesize of output 14297 [2022-11-16 12:06:43,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17299 treesize of output 16515 [2022-11-16 12:06:43,297 INFO L350 Elim1Store]: Elim1 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 4535 treesize of output 4351 [2022-11-16 12:06:43,387 INFO L350 Elim1Store]: Elim1 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 8886 treesize of output 8518 [2022-11-16 12:06:43,503 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-16 12:08:16,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:08:16,491 INFO L350 Elim1Store]: Elim1 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 10622 treesize of output 10302